제출 #206916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206916		vardan__02	동굴 (IOI13_cave)	C++14	25 / 100	51 ms	496 KiB

cave

#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <set>
#include <map>
#include "cave.h"
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
void get_d(int S[], int ss)
{
    int*d = new int[ss];
    for(int i=0;i<ss;i++)
    {
        S[i]=(S[i]+1)%2;
        int x=tryCombination(S);
        d[i]=x;
        S[i]=(S[i]+1)%2;
    }
    answer(S,d);
    delete[]d;
}
void exploreCave(int N)
{
    int n = N, x = 0, y = 0;
    int i=0;
    int*s = new int[n]{};
    while(i<=n-2)
    {
        x=tryCombination(s);
        if(x==-1)
        {
            get_d(s,n);
            delete[]s;
            return;
        }
        s[i+1]=(s[i+1]+1)%2;
        y=tryCombination(s);
        if(y==-1)
        {
            get_d(s,n);
            delete[]s;
            return;
        }
        if(x==y)
            s[i]=(s[i]+1)%2;
        i++;
    }
    x=tryCombination(s);
    if(x!=-1)
        s[n-1]=(s[n-1]+1)%2;
    get_d(s,n);
    delete[]s;
    return;
}

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