oj.uz

답안 #581411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581411 2022-06-22T15:33:11 Z islingr Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 4180 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, a, b) for (auto i{a}; i < (b); ++i)
#define per(i, a, b) for (auto i{b}; i-- > (a);)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) static_cast<int>((x).size())

template <class T>
bool uin(T& a, const T& b) {
    return a > b ? a = b, true : false;
}
template <class T>
bool uax(T& a, const T& b) {
    return a < b ? a = b, true : false;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct segment_tree {
    static constexpr int inf = 1e9;
    int n;
    vector<int> t;
    segment_tree() {}
    segment_tree(int n) : n{n}, t(2 * n, -inf) {}
    int query(int l, int r) {
        int res = -inf;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) res = max(res, t[l++]);
            if (r & 1) res = max(res, t[--r]);
        }
        return res;
    }
    void update(int p, int x) {
        for (t[p += n] = x; p >>= 1;) t[p] = max(t[p << 1], t[p << 1 | 1]);
    }
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (auto& x : a) cin >> x;

    while (m--) {
        int l, r, k;
        cin >> l >> r >> k;
        --l;

        int mx = 0;
        rep(i, l, r) rep(j, i + 1, r) if (a[i] > a[j]) mx = max(mx, a[i] + a[j]);
        cout << (mx <= k) << '\n';
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 31 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 88 ms 328 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 97 ms 212 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 31 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 88 ms 328 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 97 ms 212 KB Output is correct
11 Correct 1430 ms 308 KB Output is correct
12 Execution timed out 3060 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3050 ms 4180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3036 ms 724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 31 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 88 ms 328 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 97 ms 212 KB Output is correct
11 Correct 1430 ms 308 KB Output is correct
12 Execution timed out 3060 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 31 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 88 ms 328 KB Output is correct
9 Correct 28 ms 340 KB Output is correct
10 Correct 97 ms 212 KB Output is correct
11 Correct 1430 ms 308 KB Output is correct
12 Execution timed out 3060 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -