제출 #1268395

#제출 시각아이디문제언어결과실행 시간메모리
1268395aryanLost Array (NOI19_lostarray)C++20
11 / 100
7 ms1864 KiB
#include<bits/stdc++.h> using namespace std; using i64 = long long; int main(){ int n,m; cin >> n >> m; vector<int> hs(n); map<int,vector<pair<int,int>>> data; for(int i = 0;i < m;i++){ int a,b,x; cin >> a >> b >> x; a --; b --; hs[b] = max(hs[a],x); hs[a] = max(hs[a],x); data[x].emplace_back(a,b); } vector<int> ans(n,-1); for(auto p : data){ int x = p.first; for(auto p1 : p.second){ int i = p1.second; int j = p1.first; if(hs[i] == x){ ans[i] = x; } if(hs[j] == x){ ans[j] = x; } } } for(int i = 0;i < n;i++){ if(ans[i] == -1){ cout << (int) 1e9 << " "; }else cout << ans[i] << " "; } cout << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...