답안 #849147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
849147	2023-09-14T07:14:53 Z	sandry24	Network (BOI15_net)	C++17	0 / 100	1 ms	348 KB

net

#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
 
void solve(){
    int n;
    cin >> n;
    vector<vi> adj(n+5);
    for(int i = 0; i < n-1; i++){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    vi leaves;
    for(int i = 1; i <= n; i++)
        if(adj[i].size() == 1)
            leaves.pb(i);
    cout << ceil((double)leaves.size()/2) << '\n';
    for(int i = 0; i < leaves.size()/2; i++)
        cout << leaves[i] << ' ' << leaves[i + leaves.size()/2] << '\n';
    if(leaves.size() & 1)
        cout << leaves[0] << ' ' << leaves.back() << '\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();
    }
}

Compilation message

net.cpp: In function 'void solve()':
net.cpp:27:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0; i < leaves.size()/2; i++)
      |                    ~~^~~~~~~~~~~~~~~~~

Subtask #1

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Incorrect	0 ms	344 KB	Breaking single line is causing network to disconnect.
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Incorrect	0 ms	344 KB	Breaking single line is causing network to disconnect.
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Incorrect	0 ms	344 KB	Breaking single line is causing network to disconnect.
13	Halted	0 ms	0 KB	-