답안 #617461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
617461	2022-08-01T11:34:44 Z	Mr_Husanboy	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	340 KB

newspapers

#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>


 
 
using namespace std;
using ll = long long;


 
mt19937 rng(123);
#define ld long double
#define ull unsigned long long 
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define setp(x) setprecision(x)


ll mod=1e9+7;
int inf=1e9;
const int LOGN = 20;
const int MXX=3e5;

const long double PI = 3.1415926535897932384626433832795;
vector<vi> g;






void solve(){
	int n, m; cin >> n >> m;
	g.resize(n);
	if(m==n-1){
		cout <<"YES\n1\n1"; return;
	}else cout <<"NO";
	for(int i = 0; i < n; i ++){
		int x,y; cin >> x >> y; x--, y--;
		g[x].push_back(y); g[y].push_back(x);
	}
	
	
	
/*	cout << "YES\n";
	if(n == 2){
		cout << "2\n1 1";
	}else
	if(n == 3){
		cout << "2\n2 2";
	}else
	if(n%2 == 0){
		cout << 2*n << '\n';
		for(int i = 1; i <= n; i ++) cout << i << ' ';
		cout << n << ' ';
		for(int i = 1; i < n; i ++) cout << i << ' ';
	}else{
		cout << 2*n-1 << '\n';
		for(int i = 1; i <= n; i ++){
			cout << i << ' ';
		}
		for(int i = 1; i < n; i ++) cout << i << ' ';
	}*/
}

 
int main(){
	int testcases = 1;
//	cin >> testcases;
	while(testcases --){
		solve(); if(testcases) cout << '\n';
	}
} 

Subtask #1

0.0 / 12.0

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

Subtask #2

4.0 / 8.0

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

Subtask #3

0.0 / 80.0

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