Submission #534939

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
534939	2022-03-09T07:38:42 Z	Karuk	Newspapers (CEOI21_newspapers)	C++14	4 / 100	1 ms	292 KB

newspapers

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
    }
    if(m==n-1)cout<<"YES \n 1 1";
    else cout<<"NO";
    return 0;
}

Subtask #1

0.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Partially correct	1 ms	204 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	292 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
7	Correct	1 ms	204 KB	Output is correct
8	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #2

4.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Partially correct	1 ms	288 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
4	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	204 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	0 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	1 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	1 ms	204 KB	Failed to provide a successful strategy.
16	Partially correct	1 ms	292 KB	Failed to provide a successful strategy.
17	Partially correct	1 ms	292 KB	Failed to provide a successful strategy.
18	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
19	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
20	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.

Subtask #3

0.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Partially correct	1 ms	204 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	292 KB	Failed to provide a successful strategy.
5	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
6	Partially correct	0 ms	204 KB	Failed to provide a successful strategy.
7	Correct	1 ms	204 KB	Output is correct
8	Partially correct	1 ms	204 KB	Failed to provide a successful strategy.
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-