# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168117 | egekabas | Torrent (COI16_torrent) | C++14 | 237 ms | 27272 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 ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, a, b;
vector<int> g[300009];
bool oth[300009];
void dfs1(int v, int p){
if(oth[v]) return;
for(auto u : g[v]){
if(u == p)
continue;
dfs1(u, v);
if(oth[u]){
oth[v] = 1;
return;
}
}
}
int dp[300009];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |