oj.uz

Submission #978008

# Submission time Handle Problem Language Result Execution time Memory
978008 2024-05-08T16:07:00 Z alexdd popa (BOI18_popa) C++17
37 / 100
 146 ms 444 KB 
#include "popa.h"
#include<bits/stdc++.h>
using namespace std;
int tole[1005],tori[1005];
int calc(int le, int ri)
{
    if(le>ri)
        return -1;
    if(le==ri)
    {
        tole[le]=tori[le]=-1;
        return le;
    }
    for(int root=le;root<=ri;root++)
    {
        if(query(root,root,le,ri))
        {
            tole[root] = calc(le,root-1);
            tori[root] = calc(root+1,ri);
            return root;
        }
    }
}
int solve(int N, int* Left, int* Right)
{
    for(int i=0;i<N;i++)
        tole[i]=tori[i]=-1;
    int root = calc(0,N-1);
    for(int i=0;i<N;i++)
    {
        Left[i]=tole[i];
        Right[i]=tori[i];
    }
    return root;
}

Compilation message

popa.cpp: In function 'int calc(int, int)':
popa.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 444 KB Output is correct
2 Correct 51 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 40 ms 344 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 146 ms 432 KB too many queries
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 344 KB too many queries
2 Halted 0 ms 0 KB -