Submission #277558

#	Time	Username	Problem	Language	Result	Execution time	Memory
277558		jainbot27	Cave (IOI13_cave)	C++17	100 / 100	522 ms	640 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
//okay so you cant actually use tryCombination 70k times
/*
int tryCombination(vector<int> a){
    for(int i:a){
        cout << i << " ";
    }
    cout << endl;
    int x; cin >> x;
    return x;
}
*/

//void answer(vector<int> s, vector<int> d){
    
//}

void exploreCave(int n){
    //vector<int> cur(n,0), done(n,0), ans(n,0), ans2(n, 0);
    int cur[n], done[n], ans[n], ans2[n];
    for(int i = 0; i < n; i++){
        cur[i] = 0, done[i] = 0, ans[i] = 0, ans2[i] = 0;
    }
    for(int i=0; i < n; i++){
        int mirror[n];
        if(tryCombination(cur) == i){
            for(int j = 0; j < n; j++){
                if(!done[j])
                    cur[j] ^=1;
            }
        }
        for(int j=0; j < n; j++)
            mirror[j] = cur[j];
        int lo = 0, hi = n-1;
        while(lo < hi){
            int mid = (lo + hi)/2;
            for(int j = lo; j <= mid; j++){
                if(!done[j])
                    mirror[j] ^= 1;
            }
            //cerr << "LO " << lo << " HI " << hi << endl;
            int x = tryCombination(mirror);
            if(x != i){
                //for(int j = lo; j <= mid; j++){
                    //if(!done[j])
                        //mirror[j]^=1;
                //}
                lo = mid + 1;
            }
            else{
                //for(int j = mid + 1; j <= hi; j++){
                    //if(!done[j])
                        //mirror[j]^=1;
                //}
                hi = mid;
            }
            for(int j=0; j < n; j++){
                mirror[j] = cur[j];
            }
        }
        //cerr << "LO " << lo << endl;
        //for(int j=0; j <n; j++){
            //cerr << mirror[j] << " ";
        //}
        //cerr << endl;
        //cur[lo] ^= 1;
        done[lo] = 1;
        ans[lo] = i;
        ans2[lo] = cur[lo];
        //cerr << "NEW" << endl;
    }
    //for(int i=0; i < n; i++){
        //cout << ans[i] << " " << ans2[i] << endl;
    //}
    answer(ans2, ans);
    exit(0);
}

/*
int main(){
    exploreCave(4);
}
*/

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24