# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
812533 | andecaandeci | Tracks in the Snow (BOI13_tracks) | C++17 | 1441 ms | 888112 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>
#define int long long
#define SETIO cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define REP(i,a,b)for(int i=a;i<b;i++)
#define fi first
#define se second
#define pb push_back
#define FORI(v)for(auto i:v)
#define FORJ(v)for(auto j:v)
using namespace std;
using pii=pair<int, int>;
int color[5000][5000];
bool visited[5000][5000];
int w, h;
int bfs(){
deque<pair<pii, int>> q;
q.pb({{0,0},1});
int ans=1;
while(q.size()){
auto qt = q.front();q.pop_front();
auto top = qt.fi;
if(top.fi<0)continue;
if(top.fi>=h)continue;
if(top.se<0)continue;
if(top.se>=w)continue;
if(visited[top.fi][top.se])continue;
visited[top.fi][top.se]=true;
int cur=color[top.fi][top.se];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |