# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
48943 |
2018-05-20T06:38:05 Z |
leehosu01 |
토마토 (KOI13_tomato) |
C++17 |
|
99 ms |
6300 KB |
#include<bits/stdc++.h>
using namespace std;
#define able(X,Y) if(0<=X&&X<N&&0<=Y&&Y<M&&D[Y].test(X)==0)Q.push({Y,X}),D[Y].set(X),++to;
bitset<1000>D[1000];
int N,M,to;
struct A{int y,x;
void mov(queue<A>&Q)
{
able(x-1,y);
able(x+1,y);
able(x,y-1);
able(x,y+1);
}};
queue<A>Q;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin>>N>>M;
int a;
for(int i=0;i<M;i++)
for(int j=0;j<N;j++)
{
cin>>a;
if(a)D[i].set(j),Q.push({i,j}),++to;
}
if(to==0)printf("-1");
else
{
int pl=0;
while(to<N*M)
{
pl++;
for(int i=Q.size();i;--i)
{
Q.front().mov(Q);
Q.pop();
}
}
printf("%d",pl);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Incorrect |
3 ms |
604 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
804 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
856 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
944 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
1004 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
2164 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
3120 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
32 ms |
3564 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
99 ms |
6300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |