# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310652 | MrDomino | Political Development (BOI17_politicaldevelopment) | C++14 | 3042 ms | 10744 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;
const int N=50000+7;
int n;
int k;
int sol;
vector<int> g[N];
set<pair<int,int>> s;
void del(int x)
{
for (auto &i : g[x])
{
vector<int> gnew_i;
for (auto &y : g[i])
{
if (y!=x)
gnew_i.push_back(y);
}
s.erase({(int) g[i].size(),i});
s.insert({(int) g[i].size()-1,i});
g[i]=gnew_i;
}
g[x].clear();
}
bool on[N];
int sum[N];
# | 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... |