이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
//#define int long long
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);
//ifstream in(".in");
//ofstream out(".out");
int n, m;
vector<int>v[N];
void solve(){
cin >> n;
for(int i = 1, x, y; i < n; i++){
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
int root = 0;
vector<int>leaves;
for(int i = 1; i <= n; i++){
if(sz(v[i]) == 1){
leaves.push_back(i);
}
if(sz(v[i]) > 1)root = i;
}
cout << sz(leaves)/2 + sz(leaves) % 2 << '\n';
//cout << "L" <<'\n';
//for(auto it : leaves)cout << it << ' '; cout << '\n';
//cout << "R = " << root << '\n';
for(int i = 0; i < sz(leaves) - 1; i += 2){
cout << leaves[i] << ' ' << leaves[i + 1] << '\n';
}
if(sz(leaves) % 2){
cout << leaves[sz(leaves) - 1] << ' ' << 1 << '\n';
}
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T = 1;
//cin >> T;
while(T--){
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
net.cpp: In function 'void solve()':
net.cpp:39:9: warning: variable 'root' set but not used [-Wunused-but-set-variable]
39 | int root = 0;
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |