# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27487 | TAMREF | Tracks in the Snow (BOI13_tracks) | C++11 | 1999 ms | 595580 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 <bits/stdc++.h>
using namespace std;
const int mx=4002, ms=4000*4000+1;
vector<int> G[ms];
int rep[ms];
char F[4000][mx];
int ans=0, rt=1, d, n, m, g=1;
void bfs(){
memset(rep,0,sizeof(rep));
queue<int> node,dep;
node.push(rt);
dep.push(1);
for(;!node.empty();){
int now=node.front(), dnow=dep.front();
node.pop(); dep.pop();
if(rep[now]) continue;
rep[now]=1; d=max(d,dnow);
for(int u : G[now]){
if(!rep[u]){
node.push(u);
dep.push(dnow+1);
}
}
}
}
void input(){
scanf("%d %d\n",&n,&m);
for(int i=0;i<n;i++) fgets(F[i],mx,stdin);
}
void gennode(){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |