oj.uz

Submission #567538

# Submission time Handle Problem Language Result Execution time Memory
567538 2022-05-23T16:46:15 Z CaroLinda Lost Array (NOI19_lostarray) C++14
100 / 100
 30 ms 2592 KB 
#include <bits/stdc++.h>

#define lp(i,a,b) for(int i = a ; i < b ;i++ ) 
#define pb push_back
#define ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define ff first
#define ss second
#define pii pair<int,int>

const int MAXN = 1e5+10 ;

using namespace std ;

int N , M ;
int A[MAXN] ;

int main(){
	ios_base::sync_with_stdio(false) ;
	cin.tie(0) ;
	
	cin >> N >> M ;
	fill(A+1,A+1+N , 1 ) ;
	for(int i =1  , a ,b  , c ; i <= M ; i++ ){
		cin >> a >> b >> c ;
		A[a] = max(A[a] , c ) ;
		A[b] = max(A[b] , c ) ;
	}
	for(int i =1  ; i <= N ; i++ ) cout << A[i] << " ";
	cout << "\n" ;
}

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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 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 724 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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 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 724 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 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 5 ms 468 KB Output is correct
2 Correct 8 ms 656 KB Output is correct
3 Correct 7 ms 580 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 2 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 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 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 724 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 8 ms 656 KB Output is correct
18 Correct 7 ms 580 KB Output is correct
19 Correct 4 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 14 ms 1496 KB Output is correct
22 Correct 15 ms 1448 KB Output is correct
23 Correct 24 ms 1596 KB Output is correct
24 Correct 19 ms 1884 KB Output is correct
25 Correct 30 ms 2592 KB Output is correct