# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598655 | 2022-07-18T16:08:56 Z | alexander707070 | Art Collections (BOI22_art) | C++17 | 0 ms | 208 KB |
#include<bits/stdc++.h> #include "art.h" #define MAXN 4007 using namespace std; vector<int> w; int inv[MAXN],curr,n; vector<int> ans; void solve(int N){ n=N; for(int i=1;i<=n;i++){ w.clear(); for(int f=i;f<=n+i-1;f++){ w.push_back((f-1)%n+1); } inv[i]=publish(w); } for(int i=2;i<=n+1;i++){ curr=inv[(i-1)%n+1]-inv[i-1]; curr=-curr; curr+=n+n%2; ans.push_back(curr/2); } answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 0 ms | 208 KB | Not correct |
3 | Halted | 0 ms | 0 KB | - |