이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int,int>
pii bad = {-1,-1};
const int jonkler = 1e15;
signed main() {
int n,k;
cin >> n >> k;
int maxdeg = 0;
vector<vector<pii>> graph(n);
for (int i = 0;i < n-1; i++)
{
int a,b,c;
cin >> a >> b >> c;
graph[a].push_back({b,c});
graph[b].push_back({a,c});
}
for (int i = 0; i < n; i++)
maxdeg = max((int)graph[i].size(),maxdeg);
if (maxdeg == 2)
{
vector<int> cost(n-1,0);
for (int i = 0; i < n; i++)
for (auto a : graph[i])
if (a.ss > 1)
{
cout << "jonkler \n";
return 0;
}
vector<int> ans(n,0);
for (int i = 1; i < n; i++)
{
ans[i] = (i-1)/k;
}
for (int i = n-3; i >= 0; i--)
{
ans[i] += (n-2-i)/k;
}
for (int i = 0; i < n; i++)
cout << ans[i] << '\n';
}
else
{
cout << "jonkling\n";
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |