oj.uz

Submission #995925

# Submission time Handle Problem Language Result Execution time Memory
995925 2024-06-10T04:17:04 Z reginox Carnival (CEOI14_carnival) C++17
100 / 100
 7 ms 600 KB 
#include<bits/stdc++.h>
#define ll long long
#define all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
using namespace std;
int n, id[155] = {0, 1};
vector<int> rf;
int main(){
    cin >> n;
    int prev = 1, k;
    rf.push_back(1);
    for(int i = 2; i <= n; i++){
        cout << i << " ";
        for(int j = 1; j <= i; j++) cout << j << " ";
        cout << endl;
        cin >> k;
        if(k > prev){
            prev = k;
            rf.push_back(i);
            id[i] = prev;
        }
    }
    for(int i = 1; i <= n; i++){
        if(id[i]) continue;
        int l = 0, r = rf.size() - 1, mid;
        while(l<=r){
            mid = (l+r)>>1;
            cout << mid+2 << " " << i << " ";
            for(int i = 0; i <= mid; i++) cout << rf[i] << " ";
            cout << "\n";
            cin >> k;
            if(k < mid+2) r = mid-1;
            else l = mid+1;
        }
        id[i] = id[rf[l]];
    }
    cout << 0 << " ";
    for(int i = 1; i <= n; i++) cout << id[i] << " ";
    cout << endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 2 ms 600 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 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 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 2 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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