Submission #688423

#	Time	Username	Problem	Language	Result	Execution time	Memory
688423		Nelt	Cave (IOI13_cave)	C++17	100 / 100	971 ms	588 KiB

cave

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include "cave.h"
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void exploreCave(int n)
{
    int d[n], s[n], tmp[n];
    vv(int) v;
    memset(s, -1, sizeof(s));
    memset(d, 0, sizeof(d));
    for (ll i = 0; i < n; i++)
        v.pb(i);
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < n; j++)
            if (s[j] == -1)
                tmp[j] = 0;
            else
                tmp[j] = s[j];
        ll tp = (tryCombination(tmp) == i), l = 0, r = (ll)v.size() - 1;
        while (l <= r)
        {
            ll mid = (l + r) >> 1, x;
            for (ll j = 0; j < n; j++)
                tmp[j] = s[j];
            for (ll j = 0; j < n; j++)
                if (tmp[v[j]] == -1)
                    tmp[v[j]] = !tp;
            for (ll j = 0; j <= mid; j++)
                tmp[v[j]] = tp;
            x = tryCombination(tmp);
            if (x == -1 or x > i)
                r = mid - 1;
            else
                l = mid + 1;
        }
        d[v[r + 1]] = i;
        s[v[r + 1]] = tp;
        v.erase(v.begin() + r + 1);
    }
    answer(s, d);
}
void solve()
{
    
}
/*

*/
// int main()
// {
//     sync
//         // precomp();
//         ll t = 1;
//     // cin >> t;
//     for (ll i = 1; i <= t; i++)
//         // cout << "Case #" << i << ": ",
//         solve();
//     cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }

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