Submission #578665

#	Time	Username	Problem	Language	Result	Execution time	Memory
578665		FatihSolak	popa (BOI18_popa)	C++17	0 / 100	18 ms	464 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"
#define N 1005
using namespace std;
int L[N],R[N];
int rgroup[N];
bool ok[N];
int f(int l,int r){
    if(l > r)return -1;
    for(int i = l;i<=r;i++){
        if((rgroup[i] == rgroup[r] && ok[i]) || (l == r)){
            L[i] = f(l,i-1);
            R[i] = f(i+1,r);
            return i;
        }
    }
    assert(0);
}
int solve(int n, int* Left, int* Right){
    for(int i = 0;i<n;i++){
        L[i] = R[i] = -1;
    }
    int cnt = 1;
    for(int i = 0;i<n;i++){
        int r = i;
        while(r + 1 != n && query(i,r+1,i,i))
            r++;
        for(int j = i;j<=r;j++){
            rgroup[j] = cnt; 
            ok[j] = query(i,i,j,j);
        }
        cnt++;
        i = r;
    }
    int ret = f(0,n-1);
    for(int i = 0;i<n;i++){
        Left[i] = L[i];
        Right[i] = R[i];
    }
    return ret;
}

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