Submission #132203

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
132203	2019-07-18 13:08:25	junodeveloper	Cave (IOI13_cave)	C++14	100 / 100	542 ms	632 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "cave.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
using namespace std;
int S[5010], D[5010], cur, idx, nxt, x, W, n;
int Try() {
  int r = tryCombination(S);
  return r == -1 ? n : r;
}
void FindAll(int s, int e, int p) {
  vector<int> a;
  for(int i=s; i<=e; i++)
    if(D[i] == -1) a.push_back(i);
  int B = (sz(a) + 1) / 2;
  bool flag = true, same = true;
  for(int i=0; i<sz(a); i+=B) {
    int rgt = min(sz(a), i+B), r = -1;
    for(int j=i; j<rgt; j++) S[a[j]] ^= 1;
    if(B > 2 && !same && p < idx && p != -1) { 
      r = p;
    }
    else if(flag || B == 1) r = Try();
    for(int j=i; j<rgt; j++) S[a[j]] ^= 1;
    if(r != p) same = false;
    if(r != idx) {
      if(B == 1) {
        if(idx < r) {
          D[a[i]] = idx;
          W = a[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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