oj.uz

Submission #967639

# Submission time Handle Problem Language Result Execution time Memory
967639 2024-04-22T14:42:02 Z anton Newspapers (CEOI21_newspapers) C++17
6 / 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;
    cout<<2*n<<endl;
    for(int i = 0; i<n; i++){
        cout<<i+1<<" ";
    }
    for(int i = n-1; i>=0; i--){
        cout<<i+1<<" ";
    }
}

Subtask #1
0.0 / 12.0

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

Subtask #2
6.0 / 8.0

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