# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714401 | 2023-03-24T10:18:07 Z | vjudge1 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include "art.h" #include<bits/stdc++.h> using namespace std; int n; int f(int a){ vector<int> order; for (int i = 1; i <= n; i++) { if(i == a) continue; order.push_back(i); } order.push_back(a); return publish(order); } int f_error(int a){ vector<int> order; order.push_back(a); for (int i = 1; i <= n; i++) { if(i == a) continue; order.push_back(i); } return publish(order); } void solve(int N) { n = N; vector<int> ans(n, 0); for (int i = 1; i <= n; i++) { for(auto j : ans) cout<<j<<" "; cout<<endl; int k = f(i); int error = f_error(i); if(n % 2 == 1){ int shift = (k - error) / 2; int pos = (n + 1) / 2 - shift; ans[pos - 1] = i; }else{ int shift = (k - error + 1) / 2; int pos = (n + 2) / 2 - shift; ans[pos - 1] = i; } } answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Security violation! |
2 | Halted | 0 ms | 0 KB | - |