# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990635 | ZeroCool | Zagrade (COI17_zagrade) | C++14 | 717 ms | 60992 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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ll long long
#define ar array
#define ld long double
//#define endl '\n'
const ll N = 4e5 + 20;
const ll INF = 1e17;
const int MOD = 1e9 + 7;
int n, A[N], del[N], ans, sz[N];
vector<int> g[N];
map<int,int> cnt;
int dfs1(int x,int p){
sz[x] = 1;
for(auto u : g[x]){
if(u == p || del[u])continue;
sz[x] += dfs1(u, x);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |