oj.uz

Submission #493861

# Submission time Handle Problem Language Result Execution time Memory
493861 2021-12-13T08:27:48 Z Alexandruabcde Restore Array (RMI19_restore) C++14
100 / 100
 116 ms 972 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int INF = 1000000000;
constexpr int NMAX = 5005;
typedef pair <int, int> PII;

int N, M;
vector <PII> G[NMAX];

int sp[NMAX];

void Read () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> M;

    for (int i = 1; i <= M; ++ i ) {
        int L, R, K, Val;

        cin >> L >> R >> K >> Val;

        ++ L;
        ++ R;
        int Lg = R - L + 1;

        if (Val == 0) {
            G[L-1].push_back({Lg-K, R});
        }
        else G[R].push_back({-Lg+K-1, L-1});
    }

    for (int i = 0; i <= N; ++ i )
        sp[i] = INF;

    for (int i = 1; i <= N; ++ i ) {
        int L = i, R = i;
        G[R].push_back({0, L-1});
        G[L-1].push_back({1, R});
    }
}

bool InQueue[NMAX];
int length[NMAX];
bool sol;

void BFS () {
    queue <int> Q;

    Q.push(0);
    InQueue[0] = 1;
    sp[0] = 0;
    length[0] = 1;

    while (!Q.empty()) {
        int nod = Q.front();
        Q.pop();
        InQueue[nod] = 0;

        for (auto it : G[nod]) {
            int to = it.second;
            int cost = it.first;

            if (sp[nod] + cost < sp[to]) {
                sp[to] = sp[nod] + cost;
                length[to] = length[nod] + 1;

                if (length[to] > N || sp[to] < 0) {
                    cout << -1 << '\n';
                    return;
                }

                if (!InQueue[to]) {
                    Q.push(to);
                    InQueue[to] = 1;
                }
            }
        }
    }

    for (int i = 1; i <= N; ++ i )
        cout << sp[i] - sp[i-1] << " ";
}

int main () {
    Read();
    BFS();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 716 KB Output is correct
2 Correct 14 ms 776 KB Output is correct
3 Correct 19 ms 756 KB Output is correct
4 Correct 14 ms 728 KB Output is correct
5 Correct 4 ms 716 KB Output is correct
6 Correct 5 ms 776 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 716 KB Output is correct
2 Correct 14 ms 776 KB Output is correct
3 Correct 19 ms 756 KB Output is correct
4 Correct 14 ms 728 KB Output is correct
5 Correct 4 ms 716 KB Output is correct
6 Correct 5 ms 776 KB Output is correct
7 Correct 12 ms 816 KB Output is correct
8 Correct 11 ms 716 KB Output is correct
9 Correct 18 ms 812 KB Output is correct
10 Correct 10 ms 716 KB Output is correct
11 Correct 4 ms 804 KB Output is correct
12 Correct 4 ms 716 KB Output is correct
13 Correct 13 ms 784 KB Output is correct
14 Correct 26 ms 824 KB Output is correct
15 Correct 31 ms 716 KB Output is correct
16 Correct 116 ms 952 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 11 ms 716 KB Output is correct
12 Correct 14 ms 776 KB Output is correct
13 Correct 19 ms 756 KB Output is correct
14 Correct 14 ms 728 KB Output is correct
15 Correct 4 ms 716 KB Output is correct
16 Correct 5 ms 776 KB Output is correct
17 Correct 12 ms 816 KB Output is correct
18 Correct 11 ms 716 KB Output is correct
19 Correct 18 ms 812 KB Output is correct
20 Correct 10 ms 716 KB Output is correct
21 Correct 4 ms 804 KB Output is correct
22 Correct 4 ms 716 KB Output is correct
23 Correct 13 ms 784 KB Output is correct
24 Correct 26 ms 824 KB Output is correct
25 Correct 31 ms 716 KB Output is correct
26 Correct 116 ms 952 KB Output is correct
27 Correct 7 ms 972 KB Output is correct
28 Correct 6 ms 972 KB Output is correct
29 Correct 6 ms 972 KB Output is correct
30 Correct 7 ms 972 KB Output is correct
31 Correct 6 ms 844 KB Output is correct
32 Correct 7 ms 972 KB Output is correct
33 Correct 5 ms 844 KB Output is correct
34 Correct 5 ms 840 KB Output is correct
35 Correct 10 ms 972 KB Output is correct
36 Correct 7 ms 956 KB Output is correct