Submission #67179

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
67179	2018-08-13 13:31:25	Vahan	Cave (IOI13_cave)	C++17	100 / 100	1135 ms	644 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "cave.h"
int s[2][6000][6000],n,a[6000],x[6000],y[6000],o[6000],z[6000];
int bin(int l,int r,int u,int q)
{
    if(l==r)
        return l;
    int mid=(l+r)/2;
    for(int i=0;i<n;i++)
    {
        if(i>=l && i<=mid)
            a[i]=q;
        else
            a[i]=1-q;
    }
    for(int i=0;i<u;i++)
        a[x[i]]=y[i];
    int t=tryCombination(a);
    if(t==-1 || t>u)
        bin(l,mid,u,q);
    else
        bin(mid+1,r,u,q);
}
void exploreCave(int N)
{
    n=N;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
            a[j]=0;
        for(int j=0;j<i;j++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

cave.cpp: In function 'int bin(int, int, int, int)':
cave.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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