oj.uz

Submission #703040

# Submission time Handle Problem Language Result Execution time Memory
703040 2023-02-25T17:14:38 Z siewjh popa (BOI18_popa) C++17
100 / 100
 92 ms 416 KB 
#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve(int N, int* Left, int* Right){
    stack<int> s;
    for (int i = 0; i < N; i++){
        Left[i] = -1;
        Right[i] = -1;
    }
    for (int i = 0; i < N; i++){
        int prv = -1;
        while (!s.empty()){
            int x = s.top();
            if (query(x, x, x, i)) {
                Right[x] = i;
                break;
            }
            prv = x;
            s.pop();
        }
        Left[i] = prv;
        s.push(i);
    }
    while (s.size() > 1) s.pop();
    return s.top();
}

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 292 KB Output is correct
2 Correct 87 ms 292 KB Output is correct
3 Correct 65 ms 284 KB Output is correct
4 Correct 77 ms 416 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 288 KB Output is correct
2 Correct 82 ms 292 KB Output is correct
3 Correct 92 ms 292 KB Output is correct
4 Correct 70 ms 300 KB Output is correct