# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602431 | 2022-07-23T05:51:19 Z | MrDeboo | Art Collections (BOI22_art) | C++17 | 36 ms | 208 KB |
#include "art.h" #include <bits/stdc++.h> using namespace std; int n; int sbmt(int a){ vector<int>v; for(int i=1;i<=n;i++){ if(i==a)continue; v.push_back(i); } v.push_back(a); return publish(v); } int sbmtt(int a){ vector<int>v; v.push_back(a); for(int i=1;i<=n;i++){ if(i==a)continue; v.push_back(i); } return publish(v); } void solve(int N){ n=N; while(1){ sbmt(1); } vector<pair<int,int>>v; for(int i=1;i<=n;i++)v.push_back({sbmtt(i),i}); sort(v.begin(),v.end()); vector<int>ans; for(auto &i:v)ans.push_back(i.second); answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |