oj.uz

Submission #209433

# Submission time Handle Problem Language Result Execution time Memory
209433 2020-03-14T07:52:35 Z model_code Lost Array (NOI19_lostarray) C++17
100 / 100
 39 ms 888 KB 
#include <bits/stdc++.h>
using namespace std;
 
 
int smallest[100005], largest[100005], N, M;
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    cin >> N >> M;
 
    for(int i=0; i<M; i++) {
        int A, B, C; cin >> A >> B >> C;
        smallest[A] = max(smallest[A], C);
        smallest[B] = max(smallest[B], C);
    }
 
    for(int i=0; i<N; i++) smallest[i+1] = max(smallest[i+1], 1);
 
    for(int i=1; i<=N; i++) cout << smallest[i] << ' ';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 10 ms 760 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 10 ms 760 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 11 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 10 ms 760 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 9 ms 376 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 11 ms 376 KB Output is correct
19 Correct 9 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 19 ms 760 KB Output is correct
22 Correct 23 ms 632 KB Output is correct
23 Correct 29 ms 504 KB Output is correct
24 Correct 28 ms 888 KB Output is correct
25 Correct 39 ms 760 KB Output is correct