Submission #1164330

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1164330	2025-03-09 12:37:36	PakinDioxide	Restore Array (RMI19_restore)	C++17	0 / 100	77 ms	1156 KiB

restore

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, q;
    cin >> n >> q;
    int a[n];
    for (int i = 0; i < n; i++) a[i] = 1;
    vector <tuple <int, int, int, int, int>> v; // idx, add [1] or remove [0], value, id, min [1] or max [0]
    for (int i = 0; i < q; i++) {
        int l, r, k, c;
        cin >> l >> r >> k >> c;
        v.emplace_back(l, 1, (c == 0 ? k : k-1), i, !c);
        v.emplace_back(r+1, 0, 0, i, !c);
    }
    sort(v.begin(), v.end());
    int v_i = 0, ok = 1;
    vector <pair <int, int>> mn, mx;
    for (int i = 0; i <= n; i++) {
        while (v_i < v.size() && get<0>(v[v_i]) == i) {
            auto [idx, t, val, id, mm] = v[v_i];
            if (t == 1) {
                if (mm) mn.emplace_back(val, id);
                else mx.emplace_back(val, id);
            } else {
                if (mm) for (int j = 0; j < mn.size(); j++) {if (mn[j].second == id && mn[j].first > 0) ok = 0;}
                else for (int j = 0; j < mx.size(); j++) {if (mx[j].second == id) mx[j].first = n;}
            }
            v_i++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55