Submission #749290

#	Time	Username	Problem	Language	Result	Execution time	Memory
749290		ZeroCool	Cave (IOI13_cave)	C++14	0 / 100	46 ms	400 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#define ll long long

const int mxn = 5005;

using namespace std;

int S[mxn];
bool vis[mxn];
int D[mxn];

int n;

void flip(int s,int e){
    for(int i = s;i<=e;i++){
        if(!vis[mxn])S[i] ^= 1;
    }
}

int find(int pos){
    int s= 0;
    int e = n-1;
    if(tryCombination(S) != pos)flip(s,e);
    while(s != e){
        int m = (s+e)/2;
        flip(s,m);
        int t = tryCombination(S);
        
        flip(s,m);
        if(pos != t) e= m;
        else s = m+1;
    }
    return s;
}



void exploreCave(int N) {
    n = N;
    for(int i = 0;i<n;i++){
        int p = find(i);
        D[p] = i;
        vis[p] = true;
        S[p] ^= 1;
    }
    answer(S,D);
}

Compilation message (stderr)

cave.cpp: In function 'void flip(int, int)':
cave.cpp:17:20: warning: array subscript 5005 is above array bounds of 'bool [5005]' [-Warray-bounds]
   17 |         if(!vis[mxn])S[i] ^= 1;
      |             ~~~~~~~^
cave.cpp:10:6: note: while referencing 'vis'
   10 | bool vis[mxn];
      |      ^~~
cave.cpp: In function 'int find(int)':
cave.cpp:17:20: warning: array subscript 5005 is above array bounds of 'bool [5005]' [-Warray-bounds]
   17 |         if(!vis[mxn])S[i] ^= 1;
      |             ~~~~~~~^
cave.cpp:10:6: note: while referencing 'vis'
   10 | bool vis[mxn];
      |      ^~~
cave.cpp:17:20: warning: array subscript 5005 is above array bounds of 'bool [5005]' [-Warray-bounds]
   17 |         if(!vis[mxn])S[i] ^= 1;
      |             ~~~~~~~^
cave.cpp:10:6: note: while referencing 'vis'
   10 | bool vis[mxn];
      |      ^~~
cave.cpp:17:20: warning: array subscript 5005 is above array bounds of 'bool [5005]' [-Warray-bounds]
   17 |         if(!vis[mxn])S[i] ^= 1;
      |             ~~~~~~~^
cave.cpp:10:6: note: while referencing 'vis'
   10 | bool vis[mxn];
      |      ^~~

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