oj.uz

Submission #260214

# Submission time Handle Problem Language Result Execution time Memory
260214 2020-08-09T18:54:26 Z caoash popa (BOI18_popa) C++14
0 / 100
 20 ms 384 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include "popa.h"
 
using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
 
int n;
 
int solve(int N, int * L, int * R) {
    n = N;
    for (int i = 0; i < n; ++i) L[i] = R[i] = -1;
    vector<int> st;
    st.push_back(0);
    for (int i = 1; i < n; ++i) {
        while (!st.empty() && query(st.back(), i, i, i)) {
            R[st.back()] = -1;
            L[i] = st.back();
            st.pop_back();
        }
        if (!st.empty()) R[st.back()] = i;
        st.push_back(i);
    }
    return st[0];
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 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 20 ms 380 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 19 ms 376 KB not a valid binary tree
2 Halted 0 ms 0 KB -