oj.uz

Submission #753400

# Submission time Handle Problem Language Result Execution time Memory
753400 2023-06-05T07:13:03 Z GrindMachine Carnival (CEOI14_carnival) C++17
100 / 100
 14 ms 336 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> guys;
    vector<ll> ans(n+5);
    ll ptr = 1;

    rep1(i,n){
        ll l = 0, r = ptr-2;
        ll pos = -1;

        while(l <= r){
            ll mid = (l+r) >> 1;
            vector<ll> ask;
            for(int j = mid; j < sz(guys); ++j){
                ask.pb(guys[j]);
            }
            ask.pb(i);

            ll k = sz(ask);
            cout << k << " ";
            trav(x,ask) cout << x << " ";
            cout << endl;

            ll res; cin >> res;

            if(res < k){
                pos = mid;
                l = mid + 1;
            }
            else{
                r = mid - 1;
            }
        }

        if(pos == -1){
            ans[i] = ptr++;
            guys.pb(i);
        }
        else{
            ans[i] = ans[guys[pos]];
            guys.erase(guys.begin() + pos);
            guys.pb(i);
        }
    }

    cout << 0 << " ";
    rep1(i,n) cout << ans[i] << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

carnival.cpp: In function 'void solve(int)':
carnival.cpp:75:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for(int j = mid; j < sz(guys); ++j){
      |                                ^

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 12 ms 208 KB Output is correct
4 Correct 14 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 7 ms 316 KB Output is correct
7 Correct 8 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 13 ms 208 KB Output is correct
4 Correct 13 ms 304 KB Output is correct
5 Correct 8 ms 208 KB Output is correct
6 Correct 10 ms 320 KB Output is correct
7 Correct 9 ms 208 KB Output is correct

Subtask #5
20.0 / 20.0

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