# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750271 | vjudge1 | Carnival (CEOI14_carnival) | C++17 | 8 ms | 208 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;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;
#define hdp 1e9+7
#define MAX LLONG_MAX
#define st first
#define nd second
const int N = 155;
vi st;
int color[N];
int pro(int n){
int l = 0, r = st.size() - 1;
while(l != r){
int m = (l + r) / 2;
cout << m + 2 << ' ' << n << ' ';
for(int i=0; i<=m; i++) cout << st[i] << ' ';
cout << endl;
int ans; cin >> ans;
if(ans == m + 2) r = m;
else l = m + 1;
}
return color[l];
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
for(int i=1; i<=n; i++){
cout << i << ' ';
for(int j=1; j<=i; j++) cout << j << ' ';
cout << endl;
int ans; cin >> ans;
if(ans == st.size() + 1){
st.push_back(i);
color[i] = st.size();
}
else color[i] = pro(i);
}
cout << 0 << ' ';
for(int i=1; i<=n; i++) cout << color[i] << ' ';
cout.flush();
}
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... |