oj.uz

Submission #713417

# Submission time Handle Problem Language Result Execution time Memory
713417 2023-03-22T01:35:20 Z Pacybwoah Newspapers (CEOI21_newspapers) C++14
6 / 100
 2 ms 340 KB 
#include<iostream>
#include<vector>
using namespace std;
vector<vector<int>> graph;
int main(){
    int n,m;
    cin>>n>>m;
    int a,b;
    graph.resize(n+1);
    for(int i=0;i<m;i++){
        cin>>a>>b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    if(n<=m){
        cout<<"NO\n";
    }
    else if(n==3||n==2){
        cout<<"YES\n2\n2 2";
    }
    else if(n==1){
        cout<<"YES\n1\n1";
    }
    else{
        cout<<"YES\n";
        cout<<(n)*2<<"\n";
        for(int i=1;i<=n;i++) cout<<i<<" ";
        for(int i=n;i>=1;i--) cout<<i<<" ";
    }
}

Subtask #1
0.0 / 12.0

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
10 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
16 Partially correct 2 ms 340 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
18 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

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