oj.uz

Submission #702756

# Submission time Handle Problem Language Result Execution time Memory
702756 2023-02-25T04:29:36 Z maomao90 popa (BOI18_popa) C++17
100 / 100
 98 ms 420 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "popa.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1005;

int solve(int n, int *left, int *right) {
    REP (i, 0, n) {
        left[i] = right[i] = -1;
    }
    vi stk;
    stk.pb(0);
    REP (i, 1, n) {
        int prv = -1;
        while (!stk.empty() && !query(stk.back(), stk.back(), stk.back(), i)) {
            int u = stk.back(); stk.pop_back();
            right[u] = prv;
            prv = u;
        }
        left[i] = prv;
        stk.pb(i);
    }
    int prv = -1;
    while (!stk.empty()) {
        int u = stk.back(); stk.pop_back();
        right[u] = prv;
        prv = u;
    }
    return prv;
}

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 11 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 296 KB Output is correct
2 Correct 87 ms 296 KB Output is correct
3 Correct 52 ms 292 KB Output is correct
4 Correct 84 ms 296 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 292 KB Output is correct
2 Correct 74 ms 420 KB Output is correct
3 Correct 37 ms 336 KB Output is correct
4 Correct 66 ms 324 KB Output is correct