oj.uz

Submission #828734

# Submission time Handle Problem Language Result Execution time Memory
828734 2023-08-17T14:34:06 Z Lobo Newspapers (CEOI21_newspapers) C++17
8 / 100
 1 ms 356 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 1e3+10;

int n, m, mark[maxn];
vector<int> g[maxn];

void dfs(int u, int ant) {
    mark[u] = 1;
    for(auto v : g[u]) if(v != ant) {
        if(mark[v]) {
            cout << "NO" << endl;
            exit(0);
        }
        dfs(v,u);
    }
}

void solve() {
    cin >> n >> m;
    // for(int i = 1; i <= m; i++) {
    //     int u,v; cin >> u >> v;
    //     g[u].pb(v);
    //     g[v].pb(u);
    // }

    // dfs(1,0);

    cout << "YES" << endl;
    if(n == 1) {
        cout << 1 << endl << 1 << endl;
        return;
    }
    if(n == 2) {
        cout << 2 << endl << 1 << " " << 1 << endl;
        return;
    }

    cout << n-2+n-2 << endl;
    for(int i = 2; i <= n-1; i++) {
        cout << i << " ";
    }
    for(int i = n-1; i >= 2; i--) {
        cout << i << " ";
    }cout << endl;
}
    
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
7 Incorrect 0 ms 340 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 356 KB Output is correct

Subtask #3
0.0 / 80.0

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