제출 #425197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425197		SAAD	동굴 (IOI13_cave)	C++17	12 / 100	13 ms	416 KiB

cave

#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
//#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include "cave.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
void exploreCave(int N) {
    int com[N] , ans2[N] ;
    for(int i=0;i<N;i++) {
        com[i] = 0;
        ans2[i] = i ;
    }
    while(true) {
        int a = tryCombination(com);
        if (a == -1) {
            answer(com,ans2);
        }
        else {
            com[a] = 1 ;
        }
    }
}

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