| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 764777 | vjudge1 | Network (BOI15_net) | C++17 | 0 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define mps make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define booster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fopen(s) freopen(s".in","r",stdin);freopen(s".out","w",stdout)
using namespace std;
vector <pair<int,int>> v2;
vector <int> v;
map <int,int> cnt;
signed main()
{
booster
int n;
cin >> n;
for(int i = 1; i <= n - 1; i++){
int x,y;
cin >> x >> y;
cnt[y]++;
}
for(int i = 1; i <= n; i++){
if(cnt[i] == 0){
v.pb(i);
}
}
for(int i = 1; i < sz(v); i++) {
if(i == sz(v) - 1){
for(int j = 1; j <= n; j++){
if(cnt[j] != 0){
v2.pb(mps(j, v[i]));
break;
}
}
}
else {
v2.pb(mps(v[0], v[i]));
}
}
cout << sz(v2) << '\n';
for(auto i : v2){
cout << i.F << ' ' << i.S << '\n';
}
return 0;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
