Submission #645736

#	Time	Username	Problem	Language	Result	Execution time	Memory
645736		Kripton	popa (BOI18_popa)	C++14	0 / 100	52 ms	304 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
int st[1001],dr[1001];
int solutioneaza(int sta,int dre)
{
    if(sta==dre)
        return sta;
    for(int i=sta;i<=dre;i++)
        if(query(sta,dre,i,i)==1)
        {
            if(i!=sta)
                st[i]=solutioneaza(sta,i-1);
            if(i!=dre)
                dr[i]=solutioneaza(i+1,dre);
            return i;
        }
    return -1;
}
int solve(int n,int *Left, int *Right)
{
    memset(st,-1,sizeof(st));
    memset(dr,-1,sizeof(dr));
    int x=solutioneaza(0,n-1);
    Left=st;
    Right=dr;
    return x;
}

• Subtask 1: 0 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39