Submission #418833

#	Time	Username	Problem	Language	Result	Execution time	Memory
418833		JerryLiu06	Cave (IOI13_cave)	C++17	0 / 100	263 ms	556 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define EACH(a,x) for (auto& a: x)
 
const int MOD = 1e9 + 7;
const int MX = 520;
const ll INF = 1e18;

void exploreCave(int N) {
    int cur[N], fix[N]; int S[N], D[N];

    F0R(i, N) {
        F0R(j, N) {
            if (fix[j]) {
                cur[j] = fix[j] - 1;
            }
            else {
                cur[j] = 0;
            }
        }
        if (tryCombination(cur) == i) {
            F0R(j, N) {
                if (!fix[j]) {
                    cur[j] = 1;
                }
            }
        }
        int low = 0; int high = N - 1; int res = -1;

        while (low <= high) {
            int mid = (low + high) / 2;

            FOR(j, low, mid + 1) {
                if (!fix[j]) {
                    cur[j] = 1 - cur[j];
                }
            }
            if (tryCombination(cur) == i) {
                FOR(j, low, mid + 1) {
                    if (!fix[j]) {
                        cur[j] = 1 - cur[j];
                    }
                }
                res = mid; high = mid - 1;
            }
            else {
                low = mid + 1;
            }
        }
        S[res] = cur[res]; 
        D[res] = i;
        fix[res] = cur[res] + 1;
    }
    answer(S, D);
}

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