oj.uz

Submission #918109

# Submission time Handle Problem Language Result Execution time Memory
918109 2024-01-29T13:09:52 Z vjudge1 Carnival (CEOI14_carnival) C++17
100 / 100
 5 ms 596 KB 
#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;
    }
    cout << 0 << ' ';
    for (int i = 1; i <= n; i++) cout << col[i] << ' ';
    cout << endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 4 ms 504 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 496 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct