Submission #488407

#	Time	Username	Problem	Language	Result	Execution time	Memory
488407		SlavicG	Cave (IOI13_cave)	C++17	0 / 100	1 ms	588 KiB

cave

#include "bits/stdc++.h"
#include"cave.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

/*
int tryCombination(vector<int> s){return 0;}
void answer(vector<int> s, vector<int> k){return;}
*/
void exploreCave(int n){
    vector<int> v;
    vector<int> k;
    vector<int> a(n, -1);
    vector<int> dadada(n);
    int fff = 0;
    while(sz(v) < n){
        int c[n];
        for(int i = 0;i < sz(a);++i)c[i] = a[i];
        for(int i = 0;i < n; ++i){
            if(c[i] == -1)c[i] = 1;
        }
        int f = tryCombination(c);
        int x = (f > sz(v) || f == -1);

        int l = 0, r = n - 1, idx = -1;
        while(l <= r){
            int mid = l + r >> 1;

            for(int i = 0;i < sz(a);++i)c[i] = a[i];

            for(int i = 0;i < mid; ++i){
                if(c[i] == -1)c[i] = x;
            }
            for(int i = mid;i < n; ++i){
                if(c[i] == -1)c[i] = (!x);
            }

            f = tryCombination(c);

            if(f > sz(v) || f == -1){
                idx = mid;
                r = mid - 1;
            }else l = mid + 1;
        }
        v.pb(idx);
        dadada[idx] = fff;
        k[idx] = fff++;
    }

    int s[n], d[n];
    for(int i = 0;i < n; ++i){
        s[i] = dadada[i], d[i] = k[i];
    }
    answer(d, s);
}
/*
void solve()
{ 


}   
 
int32_t main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
}
*/

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:36:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |             int mid = l + r >> 1;
      |                       ~~^~~

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