Submission #1041287

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041287		VMaksimoski008	Restore Array (RMI19_restore)	C++17	100 / 100	96 ms	856 KiB

restore

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    vector<array<int, 3> > edges;
    for(int i=0; i<m; i++) {
        int l, r, k, val;
        cin >> l >> r >> k >> val; l++; r++;
        if(val == 0) edges.push_back({ l - 1, r, r - l + 1 - k});
        else edges.push_back({ r, l - 1, -(r - l + 1) + k - 1 });
    }

    for(int i=1; i<=n; i++) edges.push_back({ i-1, i, 1 });
    for(int i=1; i<=n; i++) edges.push_back({ i, i-1, 0 });

    vector<int> dist(n+1, 1e9); dist[0] = 0;
    for(int i=1; i<=n; i++)
        for(auto &[u, v, w] : edges) dist[v] = min(dist[v], dist[u] + w);

    for(auto &[u, v, w] : edges) {
        if(dist[v] > dist[u] + w) {
            cout << -1 << '\n';
            return 0;
        }
    }

    for(int i=1; i<=n; i++) cout << (dist[i] > dist[i-1]) << " ";
    return 0;
}

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