oj.uz

Submission #260250

# Submission time Handle Problem Language Result Execution time Memory
260250 2020-08-09T21:59:08 Z caoash popa (BOI18_popa) C++14
0 / 100
 22 ms 384 KB 
#include <bits/stdc++.h> 
#include "popa.h"
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

int solve(int N, int *L, int *R) {
    vector<int> st;
    st.pb(0);
    for (int i = 1; i < N; i++) {
        L[i] = -1, R[i] = -1;
        while (!st.empty() && query(st.back(), i, i, i)) {
            L[i] = st.back();
            st.pop_back();
        }
        if (!st.empty()) {
            R[st.back()] = i;
        }
        st.pb(i);
    }
    return st.back();
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 256 KB not a valid binary tree
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 372 KB not a valid binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 384 KB not a valid binary tree
2 Halted 0 ms 0 KB -