oj.uz

Submission #1104282

# Submission time Handle Problem Language Result Execution time Memory
1104282 2024-10-23T11:39:47 Z overwatch9 Lost Array (NOI19_lostarray) C++17
100 / 100
 53 ms 1616 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector <int> ans(n+1);
    for (int i = 1; i <= m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        ans[a] = max(ans[a], c);
        ans[b] = max(ans[b], c);
    }
    for (int i = 1; i <= n; i++) {
        if (ans[i] == 0)
            ans[i] = 1e9;
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 6 ms 1616 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 6 ms 1616 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 336 KB Output is correct
2 Correct 14 ms 336 KB Output is correct
3 Correct 11 ms 440 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 6 ms 1616 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 6 ms 336 KB Output is correct
17 Correct 14 ms 336 KB Output is correct
18 Correct 11 ms 440 KB Output is correct
19 Correct 7 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 25 ms 840 KB Output is correct
22 Correct 26 ms 592 KB Output is correct
23 Correct 35 ms 436 KB Output is correct
24 Correct 32 ms 840 KB Output is correct
25 Correct 53 ms 840 KB Output is correct