oj.uz

Submission #967643

# Submission time Handle Problem Language Result Execution time Memory
967643 2024-04-22T14:45:33 Z anton Newspapers (CEOI21_newspapers) C++17
8 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>
const int MAX_N = 1e3;
vector<int> adj[MAX_N];

signed main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n, m;
    cin>>n>>m;

    cout<<"YES"<<endl;
    if(n==1){
        cout<<1<<endl;
        cout<<1<<endl;
        return 0;
    }
    if(n==2){
        cout<<2*(n-1)<<endl;
        for(int i = 0; i<n-1; i++){
            cout<<i+1<<" ";
        }
        for(int i = n-2; i>=0; i--){
            cout<<i+1<<" ";
        }
        return 0;
    }
    else{
        cout<<2*(n-2)<<endl;
        for(int i = 1; i<n-1; i++){
            cout<<i+1<<" ";
        }
        for(int i = n-2; i>=1; i--){
            cout<<i+1<<" ";
        }
    }

}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
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 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
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 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -