oj.uz

답안 #602804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602804 2022-07-23T11:22:48 Z cadmiumsky Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int nmax = 1e3 + 5;
bool vec[nmax];
vector<int> g[nmax];

int main() {  
  int n, m;
  cin >> n >> m;
  if(m == n - 1) {
    cout << "YES\n1\n1\n";
  }
  else if(m == n) {
    for(int i = 0, x, y; i < m; i++) {
      cin >> x >> y;
      g[x].push_back(y);
      g[y].push_back(x);
    }
    for(int i = 1; i <= n; i++) {
      if(g[i].size() != 2) {
        cout << "YES\n1\n1";
        return 0;
      }
    }
    cout << "NO\n";
  }
  else
    cout << "YES\n1\n1\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 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 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 0 ms 212 KB Output is correct
8 Partially correct 0 ms 212 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 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 1 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 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
8 Partially correct 1 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 0 ms 212 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
13 Partially correct 1 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 1 ms 212 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
17 Partially correct 0 ms 212 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.

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 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 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 0 ms 212 KB Output is correct
8 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -