답안 #479016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479016	2021-10-09T11:59:13 Z	kshitij_sodani	Newspapers (CEOI21_newspapers)	C++14	4 / 100	5 ms	5012 KB

newspapers

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
vector<int> adj[200001];
int dp[200001];
int co[200001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n,m;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int aa,bb;
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
	}
	if(m!=n-1){
		cout<<"NO"<<endl;
	}
	else{
		cout<<"YES"<<endl;
		if(n==1){
			cout<<1<<endl;
			cout<<1<<endl;
			return 0;
		}
		cout<<n<<endl;
		for(int i=0;i<n;i++){
			if(i==n-1){
				cout<<i<<" ";
				continue;
			}
			cout<<i+1<<" ";
		}
		cout<<endl;
	}
/*	if(n==1){
		cout<<"YES"<<endl;
		cout<<"1"<<endl;
		cout<<"1"<<endl;
	}
	else if(n==2){
		cout<<"YES"<<endl;
		cout<<"2"<<endl;
		cout<<"1 1"<<endl;
	}
	else if(n==3){
		cout<<"YES"<<endl;
		cout<<"2"<<endl;
		cout<<"2 2"<<endl;
	}
	else{
		cout<<"NO"<<endl;
	}

*/

 
 
 
	return 0;
}

Subtask #1

0.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	4940 KB	Output is correct
3	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
4	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
5	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
6	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
7	Correct	4 ms	4940 KB	Output is correct
8	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
9	Incorrect	3 ms	5012 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

4.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	4 ms	4940 KB	Output is correct
3	Partially correct	3 ms	4940 KB	Provide a successful but not optimal strategy.
4	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
5	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
6	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
7	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
8	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
9	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
10	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
11	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
12	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.
13	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.
14	Partially correct	5 ms	4940 KB	Failed to provide a successful strategy.
15	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
16	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.
17	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
18	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.
19	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.
20	Partially correct	4 ms	4940 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	4940 KB	Output is correct
3	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
4	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
5	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
6	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
7	Correct	4 ms	4940 KB	Output is correct
8	Partially correct	3 ms	4940 KB	Failed to provide a successful strategy.
9	Incorrect	3 ms	5012 KB	Output isn't correct
10	Halted	0 ms	0 KB	-