Submission #1233671

#TimeUsernameProblemLanguageResultExecution timeMemory
1233671sophiaeternaliaPetrol stations (CEOI24_stations)C++20
0 / 100
19 ms5444 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=0; i<n; i++){
        int a=i/k;
        r[n-1-i]+=a*(n-i-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...