# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7323 | kriii | Race (IOI11_race) | C++98 | 801 ms | 25836 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 "race.h"
#include <algorithm>
#include <vector>
using namespace std;
#define MAX_N 200001
#define MAX_K 1000001
const int non = 0x3fffffff;
vector<int> G[MAX_N];
int ex[MAX_N],ey[MAX_N],l[MAX_N],K;
bool forb[MAX_N];
int ts,chk[MAX_N],cut[MAX_N],Q[MAX_N],depth[MAX_N],len[MAX_N],sz[MAX_N],line[MAX_K];
int gety(int x, int i){
return x == ex[i] ? ey[i] : ex[i];
}
int dfs(int x)
{
int head, tail, res = non;
head = tail = -1;
Q[++head] = x; chk[x] = ts; depth[x] = 0;
while (tail < head){
int p = Q[++tail];
for (int i=0;i<G[p].size();i++) if (!forb[G[p][i]]){
int q = gety(p,G[p][i]);
if (chk[q] != ts){
Q[++head] = q;
chk[q] = ts;
Compilation message (stderr)
# | 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... |