oj.uz

Submission #737953

# Submission time Handle Problem Language Result Execution time Memory
737953 2023-05-08T03:01:02 Z guagua0407 Newspapers (CEOI21_newspapers) C++17
6 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define all(x) x.begin(),x.end()
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n,m;
    cin>>n>>m;
    cout<<"YES"<<'\n';
    cout<<2*n<<'\n';
    for(int i=n;i>=1;i--){
        cout<<i<<' ';
    }
    for(int i=1;i<=n;i++){
        cout<<i<<' ';
    }
    return 0;
}

Subtask #1
0.0 / 12.0

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