Submission #1014499

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014499		huutuan	동굴 (IOI13_cave)	C++14	0 / 100	692 ms	604 KiB

cave

#include "cave.h"

#include <bits/stdc++.h>

using namespace std;

int S[5000], D[5000];

void exploreCave(int N) {
   memset(D, -1, sizeof D);
   for (int i=0; i<N; ++i){
      vector<int> v;
      for (int j=0; j<N; ++j) if (D[j]==-1) v.push_back(j);
      int id=0;
      int cur=tryCombination(S);
      for (int j=0; j<13; ++j){
         vector<int> vv;
         for (int k=0; k<(int)v.size(); ++k) if (k>>j&1){
            vv.push_back(v[k]);
         }
         for (int k:vv) S[k]^=1;
         int t=tryCombination(S);
         if (t!=cur) id|=1<<j; 
         for (int k:vv) S[k]^=1;
      }
      D[v[id]]=i;
      if (cur==i) S[v[id]]^=1;
   }
   answer(S, D);
}

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