제출 #1326551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326551		sh_qaxxorov_571	운세 보기 2 (JOI14_fortune_telling2)	C++20	0 / 100	1 ms	332 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;
const int MAX = 200005;
int tree[MAX * 4];
void update(int node, int start, int end, int idx, int val) {
    if (start == end) { tree[node] = val; return; }
    int mid = (start + end) / 2;
    if (idx <= mid) update(2 * node, start, mid, idx, val);
    else update(2 * node + 1, mid + 1, end, idx, val);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
int query(int node, int start, int end, int l, int r) {
    if (r < start || end < l) return 0;
    if (l <= start && end <= r) return tree[node];
    int mid = (start + end) / 2;
    return max(query(2 * node, start, mid, l, r), query(2 * node + 1, mid + 1, end, l, r));
}
int main() {
    int N, K;
    cin >> N >> K;
    vector<pair<int, int>> cards(N);
    for (int i = 0; i < N; i++) cin >> cards[i].first >> cards[i].second;
    vector<int> T(K);
    for (int i = 0; i < K; i++) cin >> T[i];
    return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65