oj.uz

Submission #617755

# Submission time Handle Problem Language Result Execution time Memory
617755 2022-08-01T13:38:16 Z SavicS Carnival (CEOI14_carnival) C++17
100 / 100
 9 ms 336 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 155; 

int n;

int res[mxN];

int pref[mxN];
int sufi[mxN];

int ask(vector<int> A){
    cout << sz(A) << " "; 
    for(auto c : A)cout << c << " ";
    cout << endl;
    
    int X;
    cin >> X;
    return X;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;

    vector<int> vec, A;

    int idx = 0; int pre = 0;
    ff(i,1,n){
        vec.pb(i); int sad = ask(vec);

        if(sad != pre){
            res[i] = ++idx;
            A.pb(i);
        }
        
        pre = sad;

    }

    ff(i,1,n){
        if(res[i] == 0){

            int l = 0, r = sz(A) - 1, ans = 0;
            while(l <= r){
                int mid = (l + r) / 2;

                vector<int> pom; pom.pb(i);
                ff(i,0,mid)pom.pb(A[i]); 

                if(ask(pom) == mid + 1){
                    ans = mid;
                    r = mid - 1;
                }
                else l = mid + 1;

            }

            res[i] = res[A[ans]];

        }
    }

    cout << 0 << " ";
    ff(i,1,n)cout << res[i] << " ";
    cout << endl;

    return 0;
}
/*



// probati bojenje sahovski
*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 328 KB Output is correct
2 Correct 6 ms 324 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 5 ms 276 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 7 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 7 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 7 ms 324 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 9 ms 328 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 328 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 8 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 4 ms 320 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 8 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 6 ms 336 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 3 ms 324 KB Output is correct