# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14191 | paulsohn | 토마토 (KOI13_tomato) | C++98 | 144 ms | 7012 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<queue>
using namespace std;
struct info{
int x,y,d;
info(){}
info(int x,int y,int d){ this->x=x; this->y=y; this->d=d; }
};
queue<info> Q;
int N,M,box[1010][1010],D=0,R;
int main(){
int i,j;
scanf("%d%d",&M,&N);
R=M*N;
for(i=0;i<N;++i){
for(j=0;j<M;++j){
scanf("%d",&box[i][j]);
if(box[i][j]==-1) --R;
else if(box[i][j]==1){
Q.push(info(i-1,j,1));
Q.push(info(i+1,j,1));
Q.push(info(i,j-1,1));
Q.push(info(i,j+1,1));
--R;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |