# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532461 | 2022-03-02T23:03:22 Z | qwerasdfzxcl | Newspapers (CEOI21_newspapers) | C++14 | 1 ms | 296 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main(){ int n, m; scanf("%d %d", &n, &m); if (m==n-1) printf("YES\n1\n1\n"); else printf("NO\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
3 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
4 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
5 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Partially correct | 0 ms | 288 KB | Failed to provide a successful strategy. |
9 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
3 | Partially correct | 0 ms | 292 KB | Failed to provide a successful strategy. |
4 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
5 | Partially correct | 0 ms | 288 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
7 | Partially correct | 0 ms | 292 KB | Failed to provide a successful strategy. |
8 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
9 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
10 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
11 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
12 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
13 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
14 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
15 | Partially correct | 0 ms | 296 KB | Failed to provide a successful strategy. |
16 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
17 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
18 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
19 | Partially correct | 0 ms | 296 KB | Failed to provide a successful strategy. |
20 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
3 | Partially correct | 1 ms | 204 KB | Failed to provide a successful strategy. |
4 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
5 | Partially correct | 1 ms | 288 KB | Failed to provide a successful strategy. |
6 | Partially correct | 0 ms | 204 KB | Failed to provide a successful strategy. |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Partially correct | 0 ms | 288 KB | Failed to provide a successful strategy. |
9 | Incorrect | 0 ms | 204 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |