제출 #599938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
599938		ktkerem	Cave (IOI13_cave)	C++17	100 / 100	293 ms	460 KiB

cave

/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include<bits/stdc++.h>
#include"cave.h"
/*#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
/**/
typedef int ll;
//typedef long long ll;
typedef unsigned long long ull;
typedef __int128 vll;
typedef unsigned __int128 uvll;
ll _i=0;
#define ffn(x) _i=x
#define llll std::pair<ll , ll>
#define stitr set<ll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e9+7; 
const ll ous = 4e5 + 7;
const ll dx[4] = {1 , 0 , 0 , -1} , dy[4] = {0,1,-1,0};
void exploreCave(int n){
    ll lev[n];
    ll ar[n];
    ll gd[n];
    memset(lev , -1 , sizeof(lev));
    for(ll i = 0;n>i;i++){
        for(ll j = 0;n>j;j++){
            if(lev[j] == -1){
                ar[j] = 0;
            }
            else{
                ar[j] = gd[j];
            }
        }
        ll x = (tryCombination(ar) != i ?0 :1);
        ll l = 0 , r = n - 1;
        while(r > l){
            ll md = (l + r) / 2;
            for(ll j = l;md>=j;j++){
                if(lev[j] == -1){
                    ar[j] = x ^ 1;
                }   
                else{
                    ar[j] = gd[j];
                }       
            }
            for(ll j = md + 1;r>=j;j++){
                if(lev[j] == -1){
                    ar[j] = x;
                }   
                else{
                    ar[j] = gd[j];
                }       
            }
            (tryCombination(ar) == i ?r = md :l = md + 1);
        }
        gd[l] = x;
        lev[l] = i;
    }
    answer(gd , lev);
    return;
}
/*signed main(){
    std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
    ll t=1;
    std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0; 
}*/

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp:13:1: warning: "/*" within comment [-Wcomment]
   13 | /**/
      |

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