oj.uz

Submission #1104283

# Submission time Handle Problem Language Result Execution time Memory
1104283 2024-10-23T11:42:14 Z toast12 Lost Array (NOI19_lostarray) C++14
100 / 100
 58 ms 848 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> ans(n+1, 1);
    for (int i = 0; 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++) cout << ans[i] << ' ';
    cout << '\n';
    return 0;
}

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 508 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 508 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 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 848 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 508 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 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 848 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 504 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 504 KB Output is correct
2 Correct 14 ms 436 KB Output is correct
3 Correct 11 ms 436 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 508 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 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 848 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 504 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 504 KB Output is correct
17 Correct 14 ms 436 KB Output is correct
18 Correct 11 ms 436 KB Output is correct
19 Correct 7 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 23 ms 592 KB Output is correct
22 Correct 27 ms 520 KB Output is correct
23 Correct 42 ms 336 KB Output is correct
24 Correct 33 ms 848 KB Output is correct
25 Correct 58 ms 800 KB Output is correct