oj.uz

Submission #1085063

# Submission time Handle Problem Language Result Execution time Memory
1085063 2024-09-07T13:07:18 Z browntoad ICC (CEOI16_icc) C++14
61 / 100
 113 ms 856 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define pii pair<int, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define endl '\n'
#define IOS() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
 
const ll maxn = 105;
const ll mod = 1e9+7;
const ll inf = 1ll<<60;
 
ll mpw(ll a, ll p, ll m = mod){
    ll ret = 1;
    while(p > 0){
        if (p & 1){
            ret *= a;
            ret %= m;
        }
        p >>= 1;
        a *= a;
        a %= m;
    }
    return ret;
}
ll inv(ll a){
    return mpw(a, mod-2);
}
 
/*
int query(int a, int b, int ara[], int arb[]){
    cout<<'?'<<' ';
    cout<<a<<' '<<b<<endl;
    REP(i, a) cout<<ara[i]<<' ';
    cout<<'&'<<' ';
    REP(i, b) cout<<arb[i]<<' ';
    cout<<endl;
    int in; cin>>in;
    return in;
}
 
void setRoad(int a, int b){
    cout<<'!'<<a<<' '<<b<<endl;
    int in; cin>>in;
    if (in == -1) exit(0);
}
*/
void run(int n){
    vector<vector<int>> cc;
    REP1(i, n){
        cc.pb({i});
    }
 
    int awoo = 0;
    REP(t, n-1){
        assert(SZ(cc) == n-t);
        mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
        int ret = -1;
        vector<int> t1, t2;
        do{
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            shuffle(ALL(cc), rng);
            t1.clear(); t2.clear();
            REP(i, SZ(cc)/2) for (int j:cc[i]) t1.pb(j);
            FOR(i, SZ(cc)/2, SZ(cc)) for (int j:cc[i]) t2.pb(j);
 
            ret = query(SZ(t1), SZ(t2), &t1[0], &t2[0]);
            awoo++;
            //if (awoo > 225) assert(0);
            if (ret){
                break;
            }
        }
        while(1);
 
        int l = 0, r = SZ(t2)-1;
        while(l < r){
            int mid = (l+r)>>1;
            vector<int> tt;
            FOR(i, l, mid+1){
                tt.pb(t2[i]);
            }
 
            ret = query(SZ(t1), SZ(tt), &t1[0], &tt[0]);
            if (!ret) l = mid+1;
            else r = mid;
        }
        t2 = {t2[l]};
 
        l = 0, r = SZ(t1)-1;
        while(l < r){
            int mid = (l+r)>>1;
            vector<int> tt;
            FOR(i, l, mid+1){
                tt.pb(t1[i]);
            }
 
            ret = query(SZ(tt), 1, &tt[0], &t2[0]);
            if (!ret) l = mid+1;
            else r = mid;
        }
        t1 = {t1[l]};
 
        setRoad(t1[0], t2[0]);
 
        auto it = cc.begin();
        vector<int> nw;
        while(it != cc.end()){
            vector<int> tmp = (*it);
 
            bool ex = 0;
            for (auto j:tmp){
                if (j == t1[0] || j == t2[0]){
                    ex = 1;
                    break;
                }
            }
 
            if (ex) {
                for (auto j:tmp) nw.pb(j);
                it = cc.erase(it);
            }
            else it = next(it);
        }
        cc.pb(nw);
    }
}
/*
signed main(){
    run(5);
}
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 604 KB Ok! 102 queries used.
2 Correct 4 ms 628 KB Ok! 104 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 604 KB Ok! 523 queries used.
2 Correct 33 ms 620 KB Ok! 804 queries used.
3 Correct 35 ms 600 KB Ok! 774 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 856 KB Ok! 1482 queries used.
2 Correct 113 ms 600 KB Ok! 2148 queries used.
3 Correct 87 ms 604 KB Ok! 1695 queries used.
4 Correct 88 ms 600 KB Ok! 1698 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 604 KB Ok! 1622 queries used.
2 Correct 87 ms 604 KB Ok! 1598 queries used.
3 Correct 96 ms 644 KB Ok! 1843 queries used.
4 Correct 86 ms 852 KB Ok! 1602 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 600 KB Too many queries! 1877 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 624 KB Too many queries! 1894 out of 1625
2 Halted 0 ms 0 KB -