# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595349 | 2022-07-13T16:34:23 Z | Hacv16 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 KB |
#include<bits/stdc++.h> #include<art.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int MAX = 2e6 + 15; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; #define pb push_back #define sz(x) (int) x.size() #define fr first #define sc second #define mp make_pair #define all(x) x.begin(), x.end() #define dbg(x) cout << #x << ": " << "[ " << x << " ]\n" void solve(int n){ vector<int> v(n); iota(all(v), 1); int bad = publish(v); for(int i = 0; i < n; i++){ //for each i find its place for(int j = 0; j < n; j++){ //test all possible spots if(i == j) continue; swap(v[i], v[j]); int cur = publish(v); if(cur == 0) answer(v); if(cur < bad) bad = cur; //closer to ans else swap(v[i], v[j]); //swap back } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Incorrect | 1 ms | 208 KB | Security violation! |
3 | Halted | 0 ms | 0 KB | - |