제출 #1305787

#제출 시각아이디문제언어결과실행 시간메모리
1305787discontinuousLost Array (NOI19_lostarray)C++20
100 / 100
18 ms3996 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define int long long const int MOD = 1e9 + 7; const int INF = 1e15; const int N = 1e6; int n, m, k, a, b, c, d, h, l, r, q, u, v, x, y; void solve() { cin >> n >> q; vector<int> arr(n+1, 0); while(q--) { cin >> a >> b >> c; arr[a] = max(arr[a], c); arr[b] = max(arr[b], c); } for(int i = 1; i<=n; i++) { if(!arr[i]) cout << 1000000000 << " "; else cout << arr[i] << " "; } } int32_t main() { ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); int tc = 1; // cin >> tc; while(tc--) { solve(); 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...