Submission #2790422


Source Code Expand

#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
 
using namespace std;
typedef long long ll;
 
 
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部0にする
 
vector<ll> G[100005];
std::vector<P> tree[100010];
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
 
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define re(i,a,b) for(i=a;i<=b;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
ll i,j,k,ii,jj;
ll n,m,sum,num;
ll a,b,c,d,e,ans;
ll x[500005],y[500005],z[100005];
ll ma,mi;
char s[100005];
ll dp[1005][1005],kan[1005][1005]; 
 
int main(){
	cin>>n>>m;
	for(i=0;i<n;i++){
		cin>>s;
		for(j=0;j<m;j++){
			dp[i][j] = (s[j]-'0');
		}
	}
	for(i=1;i<n-1;i++){
		for(j=1;j<m-1;j++){
			for(k=0;k<4;k++){
				x[k]=dp[i+dx[k]][j+dy[k]];
			}
			sort(x,x+4);
			a = x[0];
			assert(a>=0);
			kan[i][j] = a;
			for(k=0;k<4;k++){
				dp[i+dx[k]][j+dy[k]] -= a;
			}
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			cout<<kan[i][j];
		}
		el;
	}
	return 0;
 
	
}

Submission Info

Submission Time
Task B - アメーバ
User enjapma
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1502 Byte
Status AC
Exec Time 33 ms
Memory 21504 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 27
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt
Case Name Status Exec Time Memory
sample_01.txt AC 4 ms 13056 KB
sample_02.txt AC 4 ms 13056 KB
sample_03.txt AC 4 ms 13056 KB
subtask1_01.txt AC 4 ms 13056 KB
subtask1_02.txt AC 4 ms 13056 KB
subtask1_03.txt AC 31 ms 21504 KB
subtask1_04.txt AC 32 ms 21504 KB
subtask1_05.txt AC 32 ms 21504 KB
subtask1_06.txt AC 32 ms 21504 KB
subtask1_07.txt AC 31 ms 21504 KB
subtask1_08.txt AC 31 ms 21504 KB
subtask1_09.txt AC 33 ms 21376 KB
subtask1_10.txt AC 7 ms 15488 KB
subtask1_11.txt AC 8 ms 20224 KB
subtask1_12.txt AC 21 ms 20992 KB
subtask1_13.txt AC 13 ms 16512 KB
subtask1_14.txt AC 13 ms 16384 KB
subtask1_15.txt AC 21 ms 21120 KB
subtask1_16.txt AC 12 ms 16640 KB
subtask1_17.txt AC 11 ms 16384 KB
subtask1_18.txt AC 6 ms 15872 KB
subtask1_19.txt AC 7 ms 16128 KB
subtask1_20.txt AC 5 ms 13184 KB
subtask1_21.txt AC 13 ms 16640 KB
subtask1_22.txt AC 9 ms 18432 KB
subtask1_23.txt AC 16 ms 16896 KB
subtask1_24.txt AC 16 ms 20864 KB