oj.uz

Submission #602794

# Submission time Handle Problem Language Result Execution time Memory
602794 2022-07-23T11:17:39 Z cadmiumsky Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 212 KB 
    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main() {  
      int n, m;
      cin >> n >> m;
      if(m == n - 1) {
        cout << "YES\n2\n1 1\n";
      }
      else
        cout << "YES\n1\n1\n";
    }

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 212 KB Output is correct
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 Correct 0 ms 212 KB Output is correct
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 212 KB Output is correct
3 Partially correct 1 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 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 1 ms 212 KB Failed to provide a successful strategy.
9 Partially correct 1 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 0 ms 212 KB Failed to provide a successful strategy.
14 Partially correct 0 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 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 0 ms 212 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

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 212 KB Output is correct
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 Correct 0 ms 212 KB Output is correct
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -