답안 #940076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940076	2024-03-07T05:10:45 Z	Baizho	Network (BOI15_net)	C++14	63 / 100	5 ms	10076 KB

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt,avx2")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n;
vector<int> g[N];
vector<int> leaf;

void dfs(int v, int p = 0) {
	if(g[v].size() == 1) leaf.pb(v);
	for(auto to : g[v]) {
		if(to == p) continue;
		dfs(to, v);
	}
}

void Baizho() {
	cin>>n;
	for(int i = 1; i <= n - 1; i ++) {
		int a, b; cin>>a>>b;
		g[a].pb(b);
		g[b].pb(a);
	}
	dfs(1);
	int m = leaf.size();
	cout<<(m + 1) / 2<<"\n";
	for(int i = 0; i < (m + 1) / 2; i ++) {
		cout<<leaf[i]<<" "<<leaf[i + m / 2]<<"\n";
	}
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

net.cpp: In function 'void Freopen(std::string)':
net.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
net.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4952 KB	Output is correct
2	Correct	1 ms	4952 KB	Output is correct
3	Correct	1 ms	4956 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	1 ms	5152 KB	Output is correct
6	Correct	2 ms	4956 KB	Output is correct
7	Correct	1 ms	4952 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	1 ms	4956 KB	Output is correct
10	Correct	1 ms	4956 KB	Output is correct
11	Correct	2 ms	4956 KB	Output is correct
12	Correct	1 ms	4952 KB	Output is correct
13	Correct	1 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	1 ms	4956 KB	Output is correct
16	Correct	1 ms	4956 KB	Output is correct
17	Correct	1 ms	4956 KB	Output is correct
18	Correct	1 ms	4956 KB	Output is correct
19	Correct	1 ms	4956 KB	Output is correct
20	Correct	1 ms	4952 KB	Output is correct

Subtask #2
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4952 KB	Output is correct
2	Correct	1 ms	4952 KB	Output is correct
3	Correct	1 ms	4956 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	1 ms	5152 KB	Output is correct
6	Correct	2 ms	4956 KB	Output is correct
7	Correct	1 ms	4952 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	1 ms	4956 KB	Output is correct
10	Correct	1 ms	4956 KB	Output is correct
11	Correct	2 ms	4956 KB	Output is correct
12	Correct	1 ms	4952 KB	Output is correct
13	Correct	1 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	1 ms	4956 KB	Output is correct
16	Correct	1 ms	4956 KB	Output is correct
17	Correct	1 ms	4956 KB	Output is correct
18	Correct	1 ms	4956 KB	Output is correct
19	Correct	1 ms	4956 KB	Output is correct
20	Correct	1 ms	4952 KB	Output is correct
21	Correct	1 ms	4956 KB	Output is correct
22	Correct	2 ms	5212 KB	Output is correct
23	Correct	2 ms	5212 KB	Output is correct
24	Correct	2 ms	5212 KB	Output is correct
25	Correct	2 ms	5212 KB	Output is correct
26	Correct	2 ms	5208 KB	Output is correct
27	Correct	2 ms	5212 KB	Output is correct
28	Correct	2 ms	5212 KB	Output is correct
29	Correct	2 ms	5212 KB	Output is correct
30	Correct	1 ms	4952 KB	Output is correct
31	Correct	2 ms	5212 KB	Output is correct
32	Correct	1 ms	4956 KB	Output is correct
33	Correct	1 ms	4956 KB	Output is correct
34	Correct	1 ms	4952 KB	Output is correct
35	Correct	1 ms	4956 KB	Output is correct
36	Correct	1 ms	4956 KB	Output is correct
37	Correct	1 ms	4956 KB	Output is correct
38	Correct	2 ms	4952 KB	Output is correct
39	Correct	1 ms	4956 KB	Output is correct
40	Correct	1 ms	4956 KB	Output is correct
41	Correct	1 ms	4952 KB	Output is correct
42	Correct	2 ms	4956 KB	Output is correct
43	Correct	2 ms	4956 KB	Output is correct
44	Correct	2 ms	4956 KB	Output is correct
45	Correct	1 ms	4956 KB	Output is correct
46	Correct	2 ms	4956 KB	Output is correct
47	Correct	1 ms	4956 KB	Output is correct
48	Correct	1 ms	4956 KB	Output is correct
49	Correct	1 ms	4956 KB	Output is correct
50	Correct	1 ms	4956 KB	Output is correct
51	Correct	1 ms	4956 KB	Output is correct
52	Correct	1 ms	4956 KB	Output is correct
53	Correct	2 ms	4956 KB	Output is correct
54	Correct	1 ms	4956 KB	Output is correct
55	Correct	2 ms	4952 KB	Output is correct
56	Correct	2 ms	4956 KB	Output is correct
57	Correct	2 ms	5172 KB	Output is correct
58	Correct	2 ms	5112 KB	Output is correct

Subtask #3
0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4952 KB	Output is correct
2	Correct	1 ms	4952 KB	Output is correct
3	Correct	1 ms	4956 KB	Output is correct
4	Correct	1 ms	4956 KB	Output is correct
5	Correct	1 ms	5152 KB	Output is correct
6	Correct	2 ms	4956 KB	Output is correct
7	Correct	1 ms	4952 KB	Output is correct
8	Correct	1 ms	4956 KB	Output is correct
9	Correct	1 ms	4956 KB	Output is correct
10	Correct	1 ms	4956 KB	Output is correct
11	Correct	2 ms	4956 KB	Output is correct
12	Correct	1 ms	4952 KB	Output is correct
13	Correct	1 ms	4956 KB	Output is correct
14	Correct	1 ms	4956 KB	Output is correct
15	Correct	1 ms	4956 KB	Output is correct
16	Correct	1 ms	4956 KB	Output is correct
17	Correct	1 ms	4956 KB	Output is correct
18	Correct	1 ms	4956 KB	Output is correct
19	Correct	1 ms	4956 KB	Output is correct
20	Correct	1 ms	4952 KB	Output is correct
21	Correct	1 ms	4956 KB	Output is correct
22	Correct	2 ms	5212 KB	Output is correct
23	Correct	2 ms	5212 KB	Output is correct
24	Correct	2 ms	5212 KB	Output is correct
25	Correct	2 ms	5212 KB	Output is correct
26	Correct	2 ms	5208 KB	Output is correct
27	Correct	2 ms	5212 KB	Output is correct
28	Correct	2 ms	5212 KB	Output is correct
29	Correct	2 ms	5212 KB	Output is correct
30	Correct	1 ms	4952 KB	Output is correct
31	Correct	2 ms	5212 KB	Output is correct
32	Correct	1 ms	4956 KB	Output is correct
33	Correct	1 ms	4956 KB	Output is correct
34	Correct	1 ms	4952 KB	Output is correct
35	Correct	1 ms	4956 KB	Output is correct
36	Correct	1 ms	4956 KB	Output is correct
37	Correct	1 ms	4956 KB	Output is correct
38	Correct	2 ms	4952 KB	Output is correct
39	Correct	1 ms	4956 KB	Output is correct
40	Correct	1 ms	4956 KB	Output is correct
41	Correct	1 ms	4952 KB	Output is correct
42	Correct	2 ms	4956 KB	Output is correct
43	Correct	2 ms	4956 KB	Output is correct
44	Correct	2 ms	4956 KB	Output is correct
45	Correct	1 ms	4956 KB	Output is correct
46	Correct	2 ms	4956 KB	Output is correct
47	Correct	1 ms	4956 KB	Output is correct
48	Correct	1 ms	4956 KB	Output is correct
49	Correct	1 ms	4956 KB	Output is correct
50	Correct	1 ms	4956 KB	Output is correct
51	Correct	1 ms	4956 KB	Output is correct
52	Correct	1 ms	4956 KB	Output is correct
53	Correct	2 ms	4956 KB	Output is correct
54	Correct	1 ms	4956 KB	Output is correct
55	Correct	2 ms	4952 KB	Output is correct
56	Correct	2 ms	4956 KB	Output is correct
57	Correct	2 ms	5172 KB	Output is correct
58	Correct	2 ms	5112 KB	Output is correct
59	Runtime error	5 ms	10076 KB	Execution killed with signal 11
60	Halted	0 ms	0 KB	-

답안 #940076

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 45.0 / 45.0

Subtask #3 0 / 37.0

Subtask #1
18.0 / 18.0

Subtask #2
45.0 / 45.0

Subtask #3
0 / 37.0