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 "game.h"
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 300010
int N,K;
int L[MAX_N],E[MAX_N];
void init(int n, int k) {
N = n;
K = k;
for(int i=0;i<k;i++){
L[i] = i;
E[i] = i;
}
for(int i=k;i<n;i++){
L[i] = -1;
E[i] = N+2;
}
}
int add_teleporter(int u, int v) {
if (E[v]<=L[u]) return 1;
E[u] = min(E[u],E[v]);
L[v] = max(L[v],L[u]);
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |