제출 #38591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38591		funcsr	동굴 (IOI13_cave)	C++14	100 / 100	329 ms	640 KiB

cave

#include "cave.h"
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
#define MOD 1000000007

int S[5000];
int query() {
  return tryCombination(S);
}
int f(int l, int r, vector<int> &A, int on, int X) {
  int mid = (l+r)/2;
  if (r-l == 1) return A[l];
  for (int i=l; i<mid; i++) S[A[i]] = on;
  bool left = query() != X;
  for (int i=l; i<mid; i++) S[A[i]] = on^1;
  if (left) return f(l, mid, A, on, X);
  else return f(mid, r, A, on, X);
}
int ans[5000];
void exploreCave(int N) {
  vector<int> rest;
  rep(i, N) rest.pb(i);
  rep(i, N) {
    for (int x : rest) S[x] = 0;
    int on = 1;
    if (query() != i) on = 0;
    for (int x : rest) S[x] = on^1;
    int x = f(0, rest.size(), rest, on, i);
    rest.erase(find(all(rest), x));
    S[x] = on;
    ans[x] = i;
  }
  answer(S, ans);
}

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