Submission #2790414
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] = (ll)(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>=1);
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 |
0 |
Code Size |
1504 Byte |
Status |
RE |
Exec Time |
110 ms |
Memory |
21504 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
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 |
RE |
100 ms |
13056 KB |
subtask1_01.txt |
RE |
100 ms |
13056 KB |
subtask1_02.txt |
AC |
4 ms |
13056 KB |
subtask1_03.txt |
RE |
107 ms |
17152 KB |
subtask1_04.txt |
AC |
32 ms |
21504 KB |
subtask1_05.txt |
RE |
108 ms |
17152 KB |
subtask1_06.txt |
RE |
110 ms |
17152 KB |
subtask1_07.txt |
RE |
107 ms |
17152 KB |
subtask1_08.txt |
RE |
107 ms |
17152 KB |
subtask1_09.txt |
RE |
108 ms |
17152 KB |
subtask1_10.txt |
RE |
102 ms |
15104 KB |
subtask1_11.txt |
RE |
101 ms |
17152 KB |
subtask1_12.txt |
RE |
105 ms |
17152 KB |
subtask1_13.txt |
RE |
102 ms |
15104 KB |
subtask1_14.txt |
RE |
105 ms |
15104 KB |
subtask1_15.txt |
RE |
104 ms |
17152 KB |
subtask1_16.txt |
RE |
103 ms |
15104 KB |
subtask1_17.txt |
RE |
102 ms |
15104 KB |
subtask1_18.txt |
RE |
101 ms |
15104 KB |
subtask1_19.txt |
RE |
101 ms |
15104 KB |
subtask1_20.txt |
RE |
100 ms |
13056 KB |
subtask1_21.txt |
RE |
102 ms |
15104 KB |
subtask1_22.txt |
RE |
101 ms |
15104 KB |
subtask1_23.txt |
RE |
105 ms |
15104 KB |
subtask1_24.txt |
RE |
103 ms |
17152 KB |