oj.uz

Submission #361272

# Submission time Handle Problem Language Result Execution time Memory
361272 2021-01-29T04:23:46 Z wiwiho Carnival (CEOI14_carnival) C++14
100 / 100
 28 ms 512 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

vector<bool> d;
int n;
int lstcnt = 0;
vector<int> tmp;

int query(int l, int r){
    vector<int> t;
    for(int i = l; i <= r; i++){
        if(!d[i]) t.eb(i + 1);
    }
    lstcnt = t.size();
    cout << t.size() << " ";
    printv(t, cout);
    cout << flush;
//
//    set<int> ans;
//    for(int i : t) ans.insert(tmp[i - 1]);
//    cerr << "r " << ans.size() << " ";
//    printv(ans, cerr);
//    return ans.size();

    int rs;
    cin >> rs;
    return rs;
}

pii check(){
    int l = 0, r = n - 1;
    while(l < r){
        int m = (l + r) / 2;
        if(query(0, m) != lstcnt) r = m;
        else l = m + 1;
    }
    int t2 = l;
    l = 0, r = t2 - 1;
    while(l < r){
        int m = (l + r + 1) / 2;
        if(query(m, t2) != lstcnt) l = m;
        else r = m - 1;
    }
    return mp(l, t2);
}

int main(){
    StarBurstStream

    cin >> n;

    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[i] = i;
    d.resize(n);
//    tmp.resize(n);
//    for(int i = 0; i < n; i++) cin >> tmp[i];

    while(true){
        if(query(0, n - 1) == lstcnt) break;
        pii p = check();
        ans[p.S] = p.F;
        d[p.S] = true;
    }

    vector<int> t = ans;
    lsort(t);
    uni(t);
    for(int &i : ans) i = lower_bound(iter(t), i) - t.begin() + 1;

    cout << "0 ";
    printv(ans, cout);

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 364 KB Output is correct
2 Correct 17 ms 364 KB Output is correct
3 Correct 9 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 23 ms 364 KB Output is correct
6 Correct 21 ms 364 KB Output is correct
7 Correct 18 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 364 KB Output is correct
2 Correct 25 ms 364 KB Output is correct
3 Correct 6 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 26 ms 364 KB Output is correct
6 Correct 25 ms 364 KB Output is correct
7 Correct 26 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 364 KB Output is correct
2 Correct 20 ms 364 KB Output is correct
3 Correct 16 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 23 ms 364 KB Output is correct
6 Correct 19 ms 364 KB Output is correct
7 Correct 22 ms 364 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 364 KB Output is correct
2 Correct 13 ms 364 KB Output is correct
3 Correct 7 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 21 ms 364 KB Output is correct
6 Correct 13 ms 364 KB Output is correct
7 Correct 19 ms 364 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 512 KB Output is correct
2 Correct 27 ms 364 KB Output is correct
3 Correct 19 ms 364 KB Output is correct
4 Correct 13 ms 364 KB Output is correct
5 Correct 10 ms 364 KB Output is correct
6 Correct 8 ms 364 KB Output is correct
7 Correct 4 ms 364 KB Output is correct