# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714364 | 2023-03-24T09:42:57 Z | vjudge1 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include <bits/stdc++.h> #include "art.h" using namespace std; void solve(int n){ vector<int>v(n); for(int i = 0;i < n;++i)v[i] = i + 1; vector<int>num_of_upper(n + 1), num_of_lower(n + 1); for(int i = 0;i < n;++i){ vector<int>tempo(n); tempo[0] = v[i]; int indx = 1; for(int j = 1;j <= n;++j){ if(j != i)tempo[indx++] = j; } int c = publish(tempo); indx = 0; for(int j = 1;j <= n;++j){ if(j != i)tempo[indx] = j; } tempo.back() = i; int cprime = publish(tempo); num_of_lower[v[i]] = (n + cprime - c - 1)/ 2; num_of_upper[v[i]] = num_of_lower[v[i]] - cprime + c; } for(int i = 0;i < n;++i){ for(int j = 1;j <= n;++j){ if(num_of_upper[j] == i)v[i] = j; } } answer(v); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |