oj.uz

Submission #336736

# Submission time Handle Problem Language Result Execution time Memory
336736 2020-12-16T15:38:52 Z strawberry2005 Lost Array (NOI19_lostarray) C++14
100 / 100
 34 ms 3820 KB 
#include<bits/stdc++.h>
#define deb(x) cout << #x << ": " << x << endl
#define ll long long
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

    int n,m;
    cin>>n>>m;
    vector<int> ans(n,1e9),inp2(m);
    vector<pair<int,int>> inp(m);
    for(int i=0;i<m;i++) cin>>inp[i].first>>inp[i].second>>inp2[i];
    //sort(inp.begin(),inp.end());

    for(int i=0;i<m;i++){
        if(ans[inp[i].first-1]<inp2[i]||ans[inp[i].first-1]==1e9) ans[inp[i].first-1]=inp2[i];
        if(ans[inp[i].second-1]<inp2[i]||ans[inp[i].second-1]==1e9) ans[inp[i].second-1]=inp2[i];
    }
    for(int i=0;i<n;i++) cout<<ans[i]<<" ";
    

	return(0);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 10 ms 1644 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 9 ms 1388 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 10 ms 1644 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 9 ms 1388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 748 KB Output is correct
2 Correct 11 ms 1260 KB Output is correct
3 Correct 8 ms 1004 KB Output is correct
4 Correct 5 ms 748 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 10 ms 1644 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 9 ms 1388 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 11 ms 1260 KB Output is correct
18 Correct 8 ms 1004 KB Output is correct
19 Correct 5 ms 748 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 16 ms 2028 KB Output is correct
22 Correct 18 ms 2156 KB Output is correct
23 Correct 24 ms 2540 KB Output is correct
24 Correct 24 ms 2796 KB Output is correct
25 Correct 34 ms 3820 KB Output is correct