oj.uz

Submission #521763

# Submission time Handle Problem Language Result Execution time Memory
521763 2022-02-03T02:21:42 Z perchuts Carnival (CEOI14_carnival) C++17
100 / 100
 9 ms 312 KB 
#include <bits/stdc++.h>
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define ll long long
#define pb push_back
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf 2000000001
#define mod 1000000007 //998244353
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

int color[200];
vector<int>v;

bool inside(int x,int l,int r){
    cout<<r-l+2<<" ";
    for(int i=l;i<=r;i++)cout<<v[i]<<" ";
    cout<<x<<endl;
    int cnt;cin>>cnt;
    return cnt<r-l+2;
}


int main(){_
    int n;cin>>n;
    int last = inf,c=0;
    v.pb(0);
    for(int i=n;i>=1;i--){
        if(last==1){
            v.pb(i);
            break;
        }
        cout<<i<<" ";
        for(int j=1;j<=i;j++){
            cout<<j<<" ";
        }
        cout<<endl;
        int x;cin>>x;ckmax(c,x);
        if(x!=last&&last!=inf)v.pb(i+1);
        last = x;
    }
    
    for(int i=1;i<=c;i++)color[v[i]] = i;

    for(int i=1;i<=n;i++){
        if(color[i])continue;
        int l = 1, r = c;
        while(l<r){
            int md = (l+r)/2;
            if(inside(i,l,md)){
                r = md;
            }else l = md+1;
        }
        color[i] = l;
    }
    cout<<"0 ";
    for(int i=1;i<=n;i++)cout<<color[i]<<" ";
    cout<<endl;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 200 KB Output is correct
2 Correct 6 ms 300 KB Output is correct
3 Correct 5 ms 200 KB Output is correct
4 Correct 6 ms 200 KB Output is correct
5 Correct 8 ms 200 KB Output is correct
6 Correct 5 ms 308 KB Output is correct
7 Correct 5 ms 312 KB Output is correct