# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
956344 | 2024-04-01T16:23:30 Z | Lobo | Newspapers (CEOI21_newspapers) | C++17 | 2 ms | 348 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(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Integer parameter [name=k] equals to -4, violates the range [1, 5] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 348 KB | Integer parameter [name=k] equals to -4, violates the range [1, 5] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Integer parameter [name=k] equals to -4, violates the range [1, 5] |
2 | Halted | 0 ms | 0 KB | - |