Submission #204712

#	Time	Username	Problem	Language	Result	Execution time	Memory
204712		bogdan_ogorodniy	Cave (IOI13_cave)	C++14	0 / 100	970 ms	564 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
const int inf = 1e9 + 7;
int N;
int _S[5001], _P[5001];
// void answer(int a[], int b[]) {
//     for (int i = 0; i < N; i++) cout << a[i] << ' '; cout << '\t'; for (int i = 0; i < N; i++) cout << _S[i] << ' '; cout << '\n';
//     for (int i = 0; i < N; i++) cout << b[i] << ' '; cout << '\t'; for (int i = 0; i < N; i++) cout << _P[i] << ' '; cout << '\n';
// }
// int tryCombination(int a[]) {
//     int ans = 0;
//     vector <int> op(N + 1, 0);
//     for (int i = 0; i < N; i++) {
//         if (_S[i] == a[i]) op[_P[i]] = true;
//     }
//     while (op[ans++]);
//     return ans;
// }
int ans[5001];
int* sett(vector <int> s, vector <int> fnd, int pos, int f) {
    vector <int> temp = s;
    for (int i = 0; i < pos; i++) {
        if (!fnd[i]) {
            temp[i] = f;
        }
    }
    for (int i = pos; i < s.size(); i++) {
        if (!fnd[i]) {
            temp[i] = !f;
        }
    }
    int n = s.size();
    for (int i = 0; i < temp.size(); i++) ans[i] = temp[i];
    return ans;
}
void exploreCave(int n) {
    vector <int> s(n, 0);
    vector <int> p(n, 0);
    vector <int> fnd(n, 0);
    for (int i = 0; i < n; i++) {
        // find the switch connected with i-th door
        // find the switch position 1/0
        int k = tryCombination(sett(s, fnd, n, 1));
        // in (fnd) -- already used swithces
        bool f = 0;
        if (k >= i + 1) {
            f = true;
        }
        else {
            f = false;
        }
        int l = 0, 
            r = n - 1;
        while (r - l > 1) {
            int m = (l + r) / 2;
            int k = tryCombination(sett(s, fnd, m + 1, f));
            if (k >= i + 1) {
                r = m;
            }
            else {
                l = m + 1;
            }
        }
        k = tryCombination(sett(s, fnd, l + 1, f));
        if (k >= i + 1) {
            p[l] = i;
            s[l] = f;
            fnd[l] = true;
        }
        else {
            p[r] = i;
            s[r] = f;
            fnd[r] = true;
        }
    }
    int S[n], P[n];
    for (int i = 0; i < n; i++) {
        S[i] = s[i];
        P[i] = p[i];
    }
    answer(S, P);
}
// signed main() {
//     N = 10;
//     for (int i = 0; i < N; i++) {
//         _P[i] = i;
//     }
//     random_shuffle(_P, _P + N);
//     for (int i = 0; i < N; i++) {
//         srand(time(nullptr));
//         _S[i] = rand() % 2;
//     }
//     exploreCave(N);
//     return 0;
// } 

Compilation message (stderr)

cave.cpp: In function 'int* sett(std::vector<int>, std::vector<int>, int, int)':
cave.cpp:28:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = pos; i < s.size(); i++) {
                       ~~^~~~~~~~~~
cave.cpp:34:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < temp.size(); i++) ans[i] = temp[i];
                     ~~^~~~~~~~~~~~~
cave.cpp:33:9: warning: unused variable 'n' [-Wunused-variable]
     int n = s.size();
         ^

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