제출 #878915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878915		raul2008487	동굴 (IOI13_cave)	C++17	100 / 100	209 ms	736 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
#define ll int
#define pb push_back
#define eb emplace_back
#define vl vector<ll>
#define fi first
#define se second
#define in insert
#define mpr make_pair
#define lg(x) __lg(x)
#define bpc(x) __builtin_popcount(x)
#define all(v) v.begin(), v.end()
#define endl "\n"
 
using namespace std;
const int sz = 5005;
bool used[sz];
void exploreCave(int N) {
    ll n = N, i, j, low, high, mid, a1, a2;
    ll ans1[n], ans2[n];
    for(i=0;i<n;i++){
        ans1[i] = ans2[i] = 0;
    }
    for(i=0;i<n;i++){
        a1 = tryCombination(ans1);
        low = 0, high = n-1;
        while(low < high){
            mid = (low + high)>>1;
            for(j=low;j<=mid;j++){
                if(used[j]){continue;}
                ans1[j] = (1 - ans1[j]);
            }
            a2 = tryCombination(ans1);
            for(j=low;j<=mid;j++){
                if(used[j]){continue;}
                ans1[j] = (1 - ans1[j]);
            }
            if(a1 == -1){
                if(a2 == i){high = mid;}
                else{
                    low = mid + 1;
                }
            }
            else if(a1 == i){
                if(a2 != a1){ /// *
                    high = mid;
                }
                else{
                    low = mid + 1;
                }
            }
            else{
                if(a2 == i){
                    high = mid;
                }
                else{
                    low = mid + 1;
                }
            }
       }
       used[low] = 1;
       ans2[low] = i;
       ans1[low] = (a1 == i);
    }
    answer(ans1, ans2);
}

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