oj.uz

Submission #95156

# Submission time Handle Problem Language Result Execution time Memory
95156 2019-01-27T17:56:35 Z updown1 popa (BOI18_popa) C++17
0 / 100
 11 ms 376 KB 
#include <popa.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, P)
#define ffa ffi ffj
#define s <<" "<<
//#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
//500,000,000 operations
const int MAXN = 1000;
//Global Variables
int solve(int N, int* l, int* r) {
    ffi l[i] = r[i] = -1;
    int root = 0;
    For (i, 1, N) {
        if (query(i-1, i, i, i)) {
            /// it's the root
            l[i] = root;
            root = i;
        }
        else {
            r[i-1] = i;
        }
    }
    return root;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 320 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 376 KB not a valid solution
2 Halted 0 ms 0 KB -