oj.uz

Submission #750152

# Submission time Handle Problem Language Result Execution time Memory
750152 2023-05-29T07:15:28 Z vjudge1 Carnival (CEOI14_carnival) C++17
100 / 100
 16 ms 752 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
 
//using namespace __gnu_pbds;
using namespace std;
 
//#define int long long
//#define double long double
#define Fi first
#define Se second
#define Rep(i,a,b) for (int i=a;i<=b;++i)
#define Repu(i,b,a) for (int i=b;i>=a;--i)
#define pb push_back
#define ms(a,i) memset(a,i,sizeof(a))
#define sz size()
#define mp make_pair
#define endl '\n'
#define sef setprecision(12)<<fixed
#define cer cout<<"cak"<<endl;
 
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<double> va;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<va> vva;
 
//const double EPS=1e-9;
const double PI=acos(-1);
//const int oo=1e18;
const int MN=155;
const int mod=1e9+7;
 
using cd=complex<double>;
 
//typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> index_set;
 
int n;
int a[MN];
 
int pre[MN];
 
set<int> s[MN];
 
int cnt=1;
 
int x;
 
signed main() {
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    //cout.tie(NULL);
 
    cin>>n;
 
    Rep(i,1,n) {
        cout<<i<<" ";
        Rep(j,1,i) cout<<j<<" ";
        cout<<endl;
        cin>>pre[i];
 
        if(pre[i]==pre[i-1]+1) {
            a[i]=cnt++;
            s[i]=s[i-1];
            s[i].insert(a[i]);
        }
 
        else {
            s[i]=s[i-1];
            int l=1,r=i-1;
            while(l<=r) {
                int mid=(l+r)/2;
                cout<<mid+1<<" ";
                Rep(k,1,mid) cout<<k<<" ";
                cout<<i<<endl;
                cin>>x;
 
                if(x==pre[mid]+1) l=mid+1;
                else r=mid-1;
            }
            a[i]=a[l];
        }
 
    }
 
    cout<<0<<" ";
    Rep(i,1,n) cout<<a[i]<<" ";
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 328 KB Output is correct
2 Correct 11 ms 444 KB Output is correct
3 Correct 6 ms 592 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 9 ms 312 KB Output is correct
6 Correct 11 ms 308 KB Output is correct
7 Correct 14 ms 368 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 328 KB Output is correct
2 Correct 12 ms 476 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 10 ms 324 KB Output is correct
6 Correct 9 ms 312 KB Output is correct
7 Correct 9 ms 336 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 316 KB Output is correct
2 Correct 9 ms 336 KB Output is correct
3 Correct 11 ms 544 KB Output is correct
4 Correct 4 ms 688 KB Output is correct
5 Correct 8 ms 360 KB Output is correct
6 Correct 9 ms 312 KB Output is correct
7 Correct 9 ms 404 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 324 KB Output is correct
2 Correct 12 ms 328 KB Output is correct
3 Correct 6 ms 752 KB Output is correct
4 Correct 4 ms 720 KB Output is correct
5 Correct 8 ms 464 KB Output is correct
6 Correct 9 ms 424 KB Output is correct
7 Correct 9 ms 464 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 208 KB Output is correct
2 Correct 13 ms 356 KB Output is correct
3 Correct 8 ms 592 KB Output is correct
4 Correct 8 ms 592 KB Output is correct
5 Correct 8 ms 508 KB Output is correct
6 Correct 5 ms 636 KB Output is correct
7 Correct 5 ms 720 KB Output is correct