Submission #228969

#	Time	Username	Problem	Language	Result	Execution time	Memory
228969		tushar_2658	Cave (IOI13_cave)	C++14	25 / 100	759 ms	764 KiB

cave

#include "cave.h"
#include "bits/stdc++.h"
using namespace std;

const int maxn = 5005;
int n;
vector<pair<int, int>> v;
int s[maxn], pos[maxn], D[maxn];

bool can(int l, int r, int f, int pos){
  int s1[maxn];
  for(int i = 0; i < n; ++i){
    s1[i] = f;
  }
  for(int i = l; i <= r; ++i){
    s1[i] ^= 1;
  }
  for(auto i : v){
    s1[i.first] = i.second;
  }
  int x = tryCombination(s1);
  if(x > pos or x == -1)return 1;
  else return 0;
}

void exploreCave(int N) {
  n = N;
  for(int i = 0; i < N; ++i){
    int l = i, r = N - 1, ans = 0;
    int bit = 0;
    if(can(0, N - 1, 1, i)){}
    else {
      bit = 1;
    }
    while(l <= r){
      int mid = (l + r) >> 1;
      if(can(mid, r, bit ^ 1, i)){
        ans = mid;
        l = mid + 1;
      }else {
        r = mid - 1;
      }
    }
    v.push_back(make_pair(ans, bit));
  }
  for(int i = 0; i < N; ++i){
    s[v[i].first] = v[i].second;
  }
  for(int i = 0; i < n; ++i){
    s[i] ^= 1;
    D[i] = tryCombination(s);
    s[i] ^= 1;
  }
  answer(s, D);
}

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