Submission #717274

#	Time	Username	Problem	Language	Result	Execution time	Memory
717274		Juan	Cave (IOI13_cave)	C++14	12 / 100	552 ms	548 KiB

cave

        #include<bits/stdc++.h>
        #include "cave.h"
        using namespace std;
         
         
        void exploreCave(int N){
        	vector<int> unprocessed;
        	for(int i = 0; i < N; i++) unprocessed.push_back(i);
        	int vask[N]={}, S[N]={};
        	int D[N]={};
        	for(int i = 0; i < N; i++){
        		for(int x : unprocessed) vask[x] = 0;
        		S[i] = 1;
        		if(tryCombination(vask)!=i){
        			for(int x : unprocessed) vask[x] = 1;
        			S[i] = 0;
        		}
         
        		int pos = -1;
        		int l = 0, r = unprocessed.size()-1;
        		while(l<=r){
        			int m = (l+r)>>1;
        			for(int j = 0; j <= m; j++) vask[unprocessed[j]] = 1-vask[unprocessed[j]];
        			int ret = tryCombination(vask);
        			if(ret==i) pos = m, l = m+1;
        			else r = m-1;
         
        			for(int j = 0; j <= m; j++) vask[unprocessed[j]] = 1-vask[unprocessed[j]];
        		}
         
        		D[i] = unprocessed[pos+1];
              	vask[D[i]] = S[i];
        		unprocessed.erase(unprocessed.begin()+pos+1);
        	}
         
        	answer(S, D);
        }

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