제출 #1350190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1350190		feyza	동굴 (IOI13_cave)	C++20	0 / 100	2 ms	1092 KiB

cave

#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void solve(vector<int>v,int bit[],int ans[])
{
    int mid=tryCombination(bit);

    if(mid==-1)
    {
        answer(bit,ans);
        return;
    }

    int mididx;

    int curr;
    vector<int>right_side;
    for(int i : v)
    {
        bit[i]=1-bit[i];
        curr=tryCombination(bit);
        if(curr<mid)
            ans[i]=curr;
        if(curr>mid)
            mididx=i;
        else if(curr==mid)
            right_side.push_back(i);

        bit[i]=1-bit[i];
    }

    bit[mididx]=1-bit[mididx];

    solve(right_side,bit,ans);
}

void exploreCave(int N)
{
    vector<int>v;
    for(int i=0;i<N;i++)
        v.push_back(i);

    int ans[N],bit[N];

    for(int i=0;i<N;i++)
    {
        bit[i]=rand()%2;
    }

    solve(v,bit,ans);
}

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