제출 #319108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
319108		Wesley_Wang	동굴 (IOI13_cave)	C++14	0 / 100	6 ms	1044 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int determine[5000];
int correspond[5000];
vector<int> undone;
int undones;
 
void exploreCave(int N) {
 
    for (int i = 0; i < N; i++)
        determine[i] = rand() % 2, correspond[i] = i, undone.push_back(i);
 
    undones = N;
 
    while (undones > 0)
    {
        int pivot = tryCombination(determine);
        int pivot_point = 0;
 
        int r = N;
 		if (pivot == -1)
              break;
        bool flag = false;
        for (int p : undone)
        {
            int o = correspond[p];
            determine[correspond[o]] = !determine[correspond[o]];
            int t = tryCombination(determine);
            if (t == -1)
            {
              flag = true; 
              break;
            }
            if (t != pivot)
            {
                undone.erase(undone.begin() + p), undones--;
                correspond[p] = t;
                if (t > pivot)
                    pivot_point = p;
            }
            else
                correspond[p] = --r;
            determine[correspond[o]] = !determine[correspond[o]];
        }
      	if (flag)
          break;
        determine[correspond[pivot_point]] = !determine[correspond[pivot_point]];
    }
  	while (undones > 0)
    {
      	int o = undone[0];
        determine[o] = !determine[o];
      	int t = tryCombination(determine);
      	correspond[o] = t, undone.erase(undone.begin()), undones--;
      	determine[o] = !determine[o];
    }
    answer(determine, correspond);
}

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