oj.uz

Submission #1053233

# Submission time Handle Problem Language Result Execution time Memory
1053233 2024-08-11T09:54:01 Z Malix Carnival (CEOI14_carnival) C++14
100 / 100
 4 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int BS(int l,int r,int x,vi &a){
    if(l==r)return l;
    int m=(l+r)/2;
    cout<<m-l+2<<" ";
    REP(i,l,m+1)cout<<a[i]<<" ";
    cout<<x;
    cout<<endl;
    int t;cin>>t;
    if(t==m-l+2)return BS(m+1,r,x,a);
    else return BS(l,m,x,a);
}

int main() {   
// ios::sync_with_stdio(0);
// cin.tie(0);
// freopen("test_input.txt", "r", stdin);
// freopen("test_output.txt", "w", stdout);
    int n;cin>>n;
    vi a;
    a.PB(1);
    int k=1;
    REP(i,2,n+1){
        a.PB(i);k++;
        cout<<k<<" ";
        for(auto u:a)cout<<u<<" ";
        cout<<endl;
        int x;cin>>x;
        if(x!=k){
            k--;
            a.pop_back();
        }
    }
    map<int,int> mp;
    REP(i,0,k)mp[a[i]]=i+1;
    REP(i,1,n+1){
        if(mp[i]!=0)continue;
        mp[i]=mp[a[BS(0,k-1,i,a)]];
    }
    cout<<0<<" ";
    REP(i,1,n+1)cout<<mp[i]<<" ";
    cout<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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