oj.uz

Submission #918551

# Submission time Handle Problem Language Result Execution time Memory
918551 2024-01-30T06:33:59 Z Fikrat_Asadzadeh Carnival (CEOI14_carnival) C++17
100 / 100
 6 ms 1456 KB 
#include <bits/stdc++.h> 
using namespace std; 
typedef unsigned long long ull; 
#define ll int
typedef vector < int > vl; 
typedef set < int > setl;
#define F first
#define S second    
#define all(v) v.begin(), v.end() 
#define pll pair < int , int > 
#define db  double
#define nll cout << "\n"
#define nl endl
#define sync                          \
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) ;
const int MAX = 200 + 5; 
const long long inf = 1e18; 
map < vl, ll> mp;
ll n, a[MAX];
ll ask(vl &v){
    if(mp[v])return mp[v];
    cout << v.size() << " ";
    for(auto i : v){
        cout << i << " ";
    }
    nll;
    ll x;
    cin >> x;
    return mp[v] = x;
}
void solve(){
    vl v;
    cin >> n;
    ll x = 0;
    for(ll i = 1; i <= n; i++){
        v.push_back(i);
        ll k = ask(v);
        if(k > x)a[i] = k, x = k; 
        else{
            v.pop_back();
            ll l = 0, r = v.size() - 1;
            while(l < r){
                ll mid = (l + r) / 2;
                vl cur;
                for(ll i = 0; i <= mid; i++){
                    cur.push_back(v[i]);
                }
                ll curr = ask(cur);
                cur.push_back(i);
                ll cur2 = ask(cur);
                if(cur2 == curr){
                    r = mid;
                }
                else l = mid + 1;
            }
            a[i] = a[v[l]];
        }
    }
    cout << "0 ";
    for(ll i = 1; i <= n; i++)cout << a[i] << " ";
}
signed main(){
    ll t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 948 KB Output is correct
2 Correct 4 ms 436 KB Output is correct
3 Correct 4 ms 1456 KB Output is correct
4 Correct 2 ms 692 KB Output is correct
5 Correct 2 ms 692 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 4 ms 432 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 692 KB Output is correct
2 Correct 3 ms 720 KB Output is correct
3 Correct 5 ms 944 KB Output is correct
4 Correct 2 ms 696 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 4 ms 696 KB Output is correct
7 Correct 6 ms 980 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1208 KB Output is correct
2 Correct 4 ms 1204 KB Output is correct
3 Correct 3 ms 692 KB Output is correct
4 Correct 2 ms 692 KB Output is correct
5 Correct 4 ms 688 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 5 ms 948 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 432 KB Output is correct
2 Correct 4 ms 944 KB Output is correct
3 Correct 5 ms 948 KB Output is correct
4 Correct 5 ms 696 KB Output is correct
5 Correct 5 ms 1204 KB Output is correct
6 Correct 3 ms 1004 KB Output is correct
7 Correct 3 ms 960 KB Output is correct