# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570648 | NekoRolly | Skandi (COCI20_skandi) | C++17 | 77 ms | 21296 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;
typedef long long ll;
const int N = 5e2+4;
const int inf = 1e9;
int n,m,n1,n2,ans;
vector<int> adj[N*N],_adj[N*N];
int L[N][N],U[N][N];
int _u[N*N],_v[N*N],dis[N*N];
pair<int,int> posU[N*N],posL[N*N];
char lab[N][N];
queue<int> d;
bool vis[N*N];
bool bfs(){
for (int i=1; i<=n1; i++){
if (!_u[i]){ dis[i] = 0; d.push(i);}
else dis[i] = inf;
}
dis[0] = inf;
for (int u; d.size(); d.pop()){ u = d.front();
for (int v : adj[u]) if (dis[_v[v]] == inf){
dis[_v[v]] = dis[u] + 1; d.push(_v[v]);
}
}
return dis[0] != inf;
}
bool dfs(int u){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |