# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31224 | gs14004 | Young Zebra (KRIII5_YZ) | C++14 | 123 ms | 63284 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 pair<int, int> pi;
typedef long long lint;
const int MAXN = 1005;
const int mod = 1e9 + 7;
struct edg{int pos, d1, d2;};
int n, m;
char buf[MAXN][MAXN];
int ans[MAXN][MAXN];
vector<edg> gph[MAXN * MAXN];
int get(int x, int y){ return x * m + y; }
vector<int> v;
int vis[MAXN * MAXN], bad;
pi tr[MAXN * MAXN];
void dfs(int x, int p, int q){
if(vis[x]){
if(tr[x] != pi(p, q)){
bad = 1;
}
return;
}
vis[x] = 1;
tr[x] = pi(p, q);
v.push_back(x);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |