# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
748508 | doowey | Sum Zero (RMI20_sumzero) | C++14 | 13 ms | 19392 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;
typedef pair<ll, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)4e5 + 10;
pii F[N];
vector<int> T[N];
vector<int> Q[N];
int sol[N];
bool vis[N];
int path[N];
int iter = 0;
int lf = 0, rf = iter - 1;
int mid;
void dfs(int u){
path[iter] = u;
iter ++ ;
vis[u]=true;
for(auto xi : Q[u]){
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... |