oj.uz

Submission #832229

# Submission time Handle Problem Language Result Execution time Memory
832229 2023-08-21T07:14:05 Z QwertyPi Newspapers (CEOI21_newspapers) C++14
6 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define int long long
using namespace std;

const int MAXN = 1e3 + 11;

vector<int> ans;

void yes(){
    cout << "YES" << endl;
    cout << ans.size() << endl;
    for(auto i : ans) cout << i << ' '; cout << endl;
    exit(0);
}

void no(){
    cout << "NO" << endl;
    exit(0);
}

int32_t main(){
    int n, m; cin >> n >> m;
    if(n == 1){ ans = {1}; yes(); }

    if(n % 2){
        for(int i = 2; i <= n - 1; i++){
            ans.push_back(i);
        }
        for(int i = 2; i <= n - 1; i++){
            ans.push_back(i);
        }
    }else{
        for(int i = 2; i <= n; i++){
            ans.push_back(i);
        }
        for(int i = 2; i <= n; i++){
            ans.push_back(i);
        }
    }
    yes();
}

Compilation message

newspapers.cpp: In function 'void yes()':
newspapers.cpp:13:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   13 |     for(auto i : ans) cout << i << ' '; cout << endl;
      |     ^~~
newspapers.cpp:13:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   13 |     for(auto i : ans) cout << i << ' '; cout << endl;
      |                                         ^~~~

Subtask #1
0.0 / 12.0

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