Submission #668455

#	Time	Username	Problem	Language	Result	Execution time	Memory
668455		allin27x	Cave (IOI13_cave)	C++14	0 / 100	2082 ms	65536 KiB

cave

#include <iostream>
#include <vector>
#include <unordered_set>
#include <deque>
#include "cave.h"
using namespace std;

int tryCombination(int S[]);
void answer(int S[], int D[]);

void exploreCave(int N){
    int doors[N]={};
    int perm[N] = {};
    deque<int> av;

    unordered_set<int> f;
    int tr[N] = {};
    for (int s=0; s<N; s++){
        int pos = 0;
        for (int i=0; i<N; i++){
            if (f.count(i)) tr[i] = perm[i]; else tr[i]=0;
        }
        int r = tryCombination(tr);
        if (r==s) pos = 1;
        if (!pos) for (int i=0; i<N; i++){
            if (f.count(i)) tr[i] = perm[i]; else tr[i]=1;
        }
        while (!av.empty()) av.pop_back();
        for (int i=0; i<N; i++) if (!f.count(i)) av.push_back(i);
        int a = 0, b = av.size()-1;
        while (a!=b){
            int m = (a+b)/2;
            int q = 0;
            for (auto it = av.begin(); q<=m; it++){
                if (!f.count(*it)) tr[*it] = pos;
                q++;
            }
            r = tryCombination(tr);
            for (int i=0; i<av.size(); i++) cout<<av[i]; cout<<endl;
            if (r==s) {
                a = m+1;
                int q = 0;
                for (auto it = av.begin(); q<=m; it++){
                    if (!f.count(*it)) tr[*it] =! pos;
                    q++;
                }
                for (int i=0; i<=m; i++) av.pop_front();
            }else {
                int q = 0;
                for (auto it = av.begin(); q<=m; it++){
                    if (!f.count(*it)) tr[*it] = !pos;
                    q++;
                }
                for (int i=b; i>m; i--) av.pop_back();
                b =m;
            }

        }
        doors[av.front()] = s;
        perm[av.front()] = pos;
        f.insert(av.front());
        tr[av.front()] = pos;
    }
    answer(perm,doors);

}

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:39:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for (int i=0; i<av.size(); i++) cout<<av[i]; cout<<endl;
      |                           ~^~~~~~~~~~
cave.cpp:39:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   39 |             for (int i=0; i<av.size(); i++) cout<<av[i]; cout<<endl;
      |             ^~~
cave.cpp:39:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   39 |             for (int i=0; i<av.size(); i++) cout<<av[i]; cout<<endl;
      |                                                          ^~~~

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