# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710270 | vjudge1 | Carnival (CEOI14_carnival) | C++17 | 16 ms | 328 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;
int query(const vector<int> &c){
if (c.size() <= 1) return c.size();
cout << c.size() << "\n";
for (int i=0; i<c.size(); i++){
cout << c[i]+1 << " \n"[i == c.size()-1];
}
cout << flush;
int val; cin >> val;
return val;
}
struct dsu{
vector<int> p;
dsu(int n): p(n, -1) {}
int find(int v){
if (p[v] < 0) return v;
return p[v] = find(p[v]);
}
void merge(int a, int b){
a = find(a), b = find(b);
if (a == b) return;
if (-p[a] < -p[b]) swap(a, b);
p[a] += p[b];
p[b] = a;
}
vector<int> get_heads(){
vector<int> a;
for (int i=0; i<p.size(); i++){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |