| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 752574 |
2023-06-03T08:46:52 Z |
이동현(#9968) |
Newspapers (CEOI21_newspapers) |
C++17 |
|
1 ms |
260 KB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> deg(n);
for(int i = 0; i < m; ++i){
int x, y;
cin >> x >> y;
--x, --y;
++deg[x], ++deg[y];
}
int can = (m == n - 1 && (*max_element(deg.begin(), deg.end()) == n - 1 || *max_element(deg.begin(), deg.end()) == 2));
sort(deg.begin(), deg.end());
if(deg[0] == 1 && deg[1] == 1 && deg[2] == 1 && deg[3] == 2 && deg[4] == 3) can = 1;
if(can){
cout << "YES\n";
cout << "1\n1";
}
else{
cout << "NO\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
0 ms |
212 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 |
212 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
1 ms |
212 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 |
212 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
0 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 |
0 ms |
260 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 |
212 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
212 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
0 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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
| 6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
