# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201043 | gs14004 | Putovanje (COCI20_putovanje) | C++17 | 209 ms | 20264 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>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using pi = pair<int, int>;
using lint = long long;
const int mod = 1e9 + 7;
const int MAXN = 200005;
struct edg{
int pos, c[2];
};
int n;
vector<edg> gph[MAXN];
int par[18][MAXN], pae[MAXN][2], dep[MAXN], dx[MAXN];
void dfs2(int x, int p){
for(auto &i : gph[x]){
if(i.pos != p){
dfs2(i.pos, x);
dx[x] += dx[i.pos];
}
}
}
void dfs(int x, int p){
for(auto &i : gph[x]){
if(i.pos != p){
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... |