oj.uz

Submission #98588

# Submission time Handle Problem Language Result Execution time Memory
98588 2019-02-24T16:51:16 Z someone_aa popa (BOI18_popa) C++17
37 / 100
 83 ms 460 KB 
#include <bits/stdc++.h>
#include "popa.h"
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 110;

/*int query(int a, int b, int c, int d) {
    cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
    int answer;
    cin>>answer;
    return answer;
}*/

int parent[maxn];
int li[maxn], ri[maxn];
int solvef(int l, int r) {
    if(l > r) return -1;
    if(l == r) return l;

    for(int i=l;i<=r;i++) {
        if(query(l, i, i, r)) {
            // valid cut point
            li[i] = solvef(l, i-1);
            ri[i] = solvef(i+1, r);
            return i;
        }
    }
}
// solve function
int solve(int n, int *l , int *r) {
    for(int i=0;i<n;i++) {
        li[i] = ri[i] = -1;
        parent[i] = i;
    }
    int x = solvef(0, n-1);

    for(int i=0;i<n;i++) {
        l[i] = li[i];
        r[i] = ri[i];
    }

    return x;
}

/*int main() {
    int a[6], b[6];
    cout<<solve(6, a, b);
    return 0;
}*/

Compilation message

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

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 384 KB Output is correct
2 Correct 83 ms 256 KB Output is correct
3 Correct 20 ms 284 KB Output is correct
4 Correct 71 ms 256 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 452 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 460 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -