제출 #1233669

#제출 시각아이디문제언어결과실행 시간메모리
1233669sophiaeternaliaPetrol stations (CEOI24_stations)C++20
0 / 100
20 ms5448 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define int int64_t signed main(){ cin.tie(0); ios_base::sync_with_stdio(NULL); int n, k; cin>>n>>k; vector<int> r(n, 0); for (int i=0; i<n; i++){ int a=i/k; r[i]+=a*(n-i-1); } for (int i=n-1; i>=0; i--){ int ii=n-1-i; int a=ii/k; r[i]+=a*(n-ii-1); } vector<vector<int>> g(n); for (int i=0; i<n; i++){ int u, v, w; cin>>u>>v>>w; g[u].push_back(v); g[v].push_back(u); } vector<int> in(n); int le, la=-1; for (int i=0; i<n; i++){ if (g[i].size()==1){ le=i; break; } } for (int i=0; i<n; i++){ in[le]=i; for (auto u: g[le]){ if (u!=la){ la=le; le=u; } } } for (auto u: in){ cout<<r[u]<<"\n"; } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...