#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
srand(time(NULL));
int n; cin >> n;
auto ask = [&](vi &in){
cout << in.size();
REP(i, in.size()){
cout << " " << in[i];
}
cout << endl;
int res; cin >> res;
return res;
};
vector<set<int>> components(n);
REP(i, n)
components[i] = {i + 1};
int all_num = 0;
vi _all(n);
REP(i, n) _all[i] = i + 1;
all_num = ask(_all);
REP(j, n - all_num){
vector<set<int>> nc = components;
auto half = [&](){
while(true){
random_shuffle(all(nc));
int m;
if(nc.size()%2 == 0)
m = (int)nc.size() / 2;
else
m = (int)nc.size() / 2 + 1;
vi qset;
REP(i, m){
for(int x : nc[i])
qset.pb(x);
}
if(ask(qset) != m){
vector<set<int>> ncc;
REP(i, m)
ncc.pb(nc[i]);
nc = ncc;
return nc;
}
}
};
while(nc.size() > 2){
half();
}
int i1 = 0;
int i2 = 0;
REP(i, components.size()){
if(nc[0] == components[i])
i1 = i;
if(nc[1] == components[i])
i2 = i;
}
for(int x : components[i2]){
components[i1].insert(x);
}
components.erase(components.begin() + i2);
}
vi ans(n);
REP(i, components.size()){
for(int x : components[i])
ans[x - 1] = i + 1;
}
cout << 0 << " ";
REP(i, n)
cout << ans[i] << " ";
cout << endl;
return 0;
}
Compilation message
carnival.cpp: In lambda function:
carnival.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
carnival.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
carnival.cpp:92:9: note: in expansion of macro 'REP'
92 | REP(i, in.size()){
| ^~~
carnival.cpp: In function 'int main()':
carnival.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
carnival.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
carnival.cpp:135:9: note: in expansion of macro 'REP'
135 | REP(i, components.size()){
| ^~~
carnival.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
carnival.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
carnival.cpp:147:5: note: in expansion of macro 'REP'
147 | REP(i, components.size()){
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
19 ms |
364 KB |
Output is correct |
| 2 |
Correct |
21 ms |
364 KB |
Output is correct |
| 3 |
Correct |
11 ms |
364 KB |
Output is correct |
| 4 |
Correct |
2 ms |
364 KB |
Output is correct |
| 5 |
Correct |
15 ms |
364 KB |
Output is correct |
| 6 |
Correct |
14 ms |
364 KB |
Output is correct |
| 7 |
Correct |
21 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
364 KB |
Output is correct |
| 2 |
Correct |
23 ms |
364 KB |
Output is correct |
| 3 |
Correct |
9 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
364 KB |
Output is correct |
| 5 |
Correct |
20 ms |
364 KB |
Output is correct |
| 6 |
Correct |
17 ms |
364 KB |
Output is correct |
| 7 |
Correct |
22 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
408 KB |
Output is correct |
| 2 |
Correct |
21 ms |
364 KB |
Output is correct |
| 3 |
Correct |
18 ms |
364 KB |
Output is correct |
| 4 |
Correct |
3 ms |
364 KB |
Output is correct |
| 5 |
Correct |
18 ms |
364 KB |
Output is correct |
| 6 |
Correct |
23 ms |
364 KB |
Output is correct |
| 7 |
Correct |
20 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
364 KB |
Output is correct |
| 2 |
Correct |
26 ms |
364 KB |
Output is correct |
| 3 |
Correct |
9 ms |
364 KB |
Output is correct |
| 4 |
Correct |
2 ms |
364 KB |
Output is correct |
| 5 |
Correct |
22 ms |
364 KB |
Output is correct |
| 6 |
Correct |
18 ms |
364 KB |
Output is correct |
| 7 |
Correct |
22 ms |
364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
22 ms |
364 KB |
Output is correct |
| 2 |
Correct |
24 ms |
364 KB |
Output is correct |
| 3 |
Correct |
18 ms |
364 KB |
Output is correct |
| 4 |
Correct |
14 ms |
364 KB |
Output is correct |
| 5 |
Correct |
14 ms |
364 KB |
Output is correct |
| 6 |
Correct |
11 ms |
364 KB |
Output is correct |
| 7 |
Correct |
3 ms |
364 KB |
Output is correct |
