#include <bits/stdc++.h>
// author: aykhn
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
const int LOG = 22;
const int MXN = 150;
const int base = 47;
const int mod = 1e9 + 7;
int col[MXN];
int per[MXN];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
col[1] = 1;
per[1] = 1;
int cur = 1;
for (int i = 2; i <= n; i++)
{
cout << cur + 1 << ' ';
for (int j = 1; j <= cur; j++) cout << per[j] << ' ';
cout << i << endl;
int res;
cin >> res;
if (res == cur + 1)
{
col[i] = ++cur;
per[cur] = i;
continue;
}
int l = 1;
int r = cur;
while (l < r)
{
int mid = (l + r) >> 1;
cout << mid + 1 << ' ';
for (int j = 1; j <= mid; j++)
{
cout << per[j] << ' ';
}
cout << i << endl;
int res;
cin >> res;
if (res == mid + 1) l = mid + 1;
else r = mid;
}
per[l] = i;
col[i] = l;
}
for (int i = 1; i <= n; i++) cout << col[i] << ' ';
cout << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
344 KB |
Same person came twice to the party. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
344 KB |
Same person came twice to the party. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
344 KB |
Same person came twice to the party. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Same person came twice to the party. |
2 |
Halted |
0 ms |
0 KB |
- |