이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
vector<vi> adj(500005);
vector<bool> visited(500005);
int maxdist = 0, maxnode1 = -1, maxnode2 = -1;
void dfs(int x, int d, int &maxdist, int &maxnode){
visited[x] = 1;
if(maxdist < d){
maxdist = d;
maxnode = x;
}
for(auto i : adj[x])
if(!visited[i])
dfs(i, d+1, maxdist, maxnode);
}
void solve(){
int n;
cin >> n;
for(int i = 0; i < n-1; i++){
int a, b;
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
dfs(1, 0, maxdist, maxnode1);
visited = vector<bool>(500005);
maxdist = 0;
dfs(maxnode1, 0, maxdist, maxnode2);
vi leaves;
for(int i = 1; i <= n; i++)
if(adj[i].size() == 1 && i != maxnode1 && i != maxnode2)
leaves.pb(i);
cout << ceil((double)leaves.size()/2) + 1 << '\n';
cout << maxnode1 << ' ' << maxnode2 << '\n';
for(int i = 1; i < leaves.size(); i += 2)
cout << leaves[i-1] << ' ' << leaves[i] << '\n';
if(leaves.size() & 1)
cout << leaves.back() << ' ' << maxnode1 << '\n';
}
int main(){
//freopen("flota.in", "r", stdin);
//freopen("flota.out", "w", stdout);
//ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
net.cpp: In function 'void solve()':
net.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i = 1; i < leaves.size(); i += 2)
| ~~^~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |