Submission #975040

#	Time	Username	Problem	Language	Result	Execution time	Memory
975040		rahidilbayramli	Cave (IOI13_cave)	C++17	0 / 100	191 ms	576 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void exploreCave(int N) {
    int n = N, i, j;
    int isfound[n], f[n], sw[n], fa[n];
    for(i = 0; i < n; i++)
    {
        f[i] = 0;
        isfound[i] = 0;
        sw[i] = 0;
    }
    for(i = 0; i < n; i++)
    {
        int ans = n;
        int ask = tryCombination(f);
        if(ask == i){
            int l = i, r = n - 1;
            while(l <= r)
            {
                for(j = 0; j < n; j++)
                    fa[j] = f[j];
                int mid = (l + r) / 2;
                for(j = 0; j <= mid; j++)
                {
                    if(!isfound[j])
                        fa[j] = 1 - f[j];
                }
                int res = tryCombination(fa);
                if(res != i)
                {
                    ans = min(ans, mid);
                    r = mid - 1;
                }
                else
                    l = mid + 1;
            }
            isfound[ans] = 1;
            sw[ans] = i;
            f[ans] = 1 - f[ans];
        }
        else
        {
            int l = i, r = n - 1;
            while(l <= r)
            {
                for(j = 0; j < n; j++)
                    fa[j] = f[j];
                int mid = (l + r) / 2;
                for(j = 0; j <= mid; j++)
                {
                    if(!isfound[j])
                        fa[j] = 1 - f[j];
                }
                int res = tryCombination(fa);
                if(res == i)
                {
                    ans = min(ans, mid);
                    r = mid - 1;
                }
                else
                    l = mid + 1;
            }
            isfound[ans] = 1;
            sw[ans] = i;
            f[ans] = 1 - f[ans];
        }
    }
    answer(f, sw);
}

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