Submission #1272711

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272711		zagaro	동굴 (IOI13_cave)	C++20	25 / 100	178 ms	628 KiB

cave

#include<bits/stdc++.h>
#include "cave.h"
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
void exploreCave(int n) {
    int l, r, ind, m, opc, a, b;
    int D[n];
    for(int i=0;i<n;i++)D[i]= -1;
    int S[n];
    int s[n];
    vector<pair<int,int> > vec;
    for(int i=0;i<n;i++){
        l = 0;
        r = n-1;
        for(int k=0;k<n;k++)s[k] = 0;
        for(int k=0;k<vec.size();k++)s[vec[k].first] = vec[k].second;
        opc = tryCombination(s);
        if(opc == -1)opc = n+1;
        if(opc > i){
            a=0;b=1;
            S[i] = 0;
            for(int k=0;k<n;k++){
                if(D[k] == -1)s[k] = b;
            }
        }
        else {a=1;b=0;S[i]=1;}
        wl(l < r){
            m = (l+r)/2;
            for(int k=l;k<=m;k++)if(D[k] == -1)s[k]=a;
            opc = tryCombination(s);
            if(opc == -1)opc= n+1;
            if(opc > i){
                for(int k=l;k<=m;k++)if(D[k] == -1)s[k]=b;
                r=m;
            }
            else l = m+1;
        }
        D[l] = i;
        vec.push_back({l,a});
    }
    answer(S, D);
    return ;
}

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