oj.uz

Submission #118564

# Submission time Handle Problem Language Result Execution time Memory
118564 2019-06-19T08:33:39 Z minhtung0404 Carnival (CEOI14_carnival) C++17
100 / 100
 11 ms 428 KB 
//https://oj.uz/problem/view/CEOI14_carnival

#include<bits/stdc++.h>
const int N = 155;
using namespace std;

int n, pset[N], ans[N], a[N], cnt;

int ask(int l, int r, int x){
    cout << r - l + 2 << " ";
    for (int i = l; i <= r; i++) cout << a[i] << " ";
    cout << x << endl;
    int ans; cin >> ans;
    return ans;
}

int main(){
    cin >> n;
    for (int i = 1; i <= n; i++){
        if (ask(1, cnt, i) == cnt+1){
            pset[i] = i;
            ans[i] = cnt+1;
            a[++cnt] = i;
        }
        else{
            int l = 1, r = cnt;
            while (l != r){
                int mid = (l + r) >> 1;
                if (ask(l, mid, i) == mid - l + 1) r = mid;
                else l = mid+1;
            }
            pset[i] = a[l];
            ans[i] = ans[a[l]];
        }
    }
    cout << 0 << " ";
    for (int i = 1; i <= n; i++) cout << ans[i] << " ";
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 8 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 4 ms 316 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 11 ms 384 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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