oj.uz

Submission #647504

# Submission time Handle Problem Language Result Execution time Memory
647504 2022-10-03T02:05:09 Z LeonaRaging Lost Array (NOI19_lostarray) C++14
100 / 100
 28 ms 2600 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 1e5 + 4;
const int INF = 1e9;

int n, m, q, res[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> m;
    fill(res + 1, res + 1 + n, 1);
    for (int i = 1; i <= m; i++) {
        int a, b, x; cin >> a >> b >> x;
        res[a] = max(res[a], x);
        res[b] = max(res[b], x);
    }
    for (int i = 1; i <= n; i++)
        cout << res[i] << ' ';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 712 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 8 ms 596 KB Output is correct
3 Correct 6 ms 560 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 712 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 8 ms 596 KB Output is correct
18 Correct 6 ms 560 KB Output is correct
19 Correct 4 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 13 ms 1356 KB Output is correct
22 Correct 14 ms 1564 KB Output is correct
23 Correct 19 ms 1620 KB Output is correct
24 Correct 19 ms 1988 KB Output is correct
25 Correct 28 ms 2600 KB Output is correct