oj.uz

Submission #984376

# Submission time Handle Problem Language Result Execution time Memory
984376 2024-05-16T15:11:58 Z alexdd Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 708 KB 
#include<iostream>
using namespace std;
int n,m;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    int a,b;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
    }
    if(m!=n-1)
    {
        cout<<"NO\n";
        return 0;
    }
    cout<<"YES\n";
    if(n==1)
    {
        cout<<1<<"\n"<<1;
        return 0;
    }
    if(n<=3)
    {
        cout<<2<<"\n"<<"2 2";
        return 0;
    }
    cout<<2*(n-1)<<"\n";
    cout<<2<<" ";
    for(int i=2;i<=n;i++)
        cout<<i<<" ";
    for(int i=2;i<n;i++)
        cout<<i<<" ";
    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Correct 0 ms 344 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 344 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 604 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
9 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 0 ms 600 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 452 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 708 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Correct 0 ms 344 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 344 KB Output isn't correct
10 Halted 0 ms 0 KB -