제출 #304390

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304390		vivaan_gupta	동굴 (IOI13_cave)	C++14	12 / 100	24 ms	384 KiB

cave

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "cave.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;

 
const ll INF = 1e12;
// const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
/*int tryCombination(int a[]){
	return 0;
}*/
void exploreCave(int N){
	int n = N;
	int a[n];
	for(int i = 0;i<n;i++){
		a[i] = 0;
		int cave = tryCombination(a);
		if(cave == i) a[i] = 1;
		else a[i] = 0; 
	}
	int s[n];
	for(int i =0;i<n;i++) s[i] = i;
	answer(a,s);
}

/*
void solve(){
		
}
signed main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
     // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}*/

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