# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
592765 | 2022-07-09T14:51:37 Z | Blagojce | Art Collections (BOI22_art) | C++17 | 1 ms | 336 KB |
#include <bits/stdc++.h> #define fr(i, n, m) for(int i = (n); i <= (m); i ++) #define st first #define nd second #define pb push_back #define pq priority_queue #define all(x) begin(x), end(x) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; #include "art.h" void solve(int N){ vector<int> v; fr(i, 1, N){ v.pb(i); } vector<int> ans(N); long long tot = publish(v); fr(i, 0, N-1){ swap(v[i], v.back()); long long nw = publish(v); int B = 2*tot + nw - (N-1); swap(v[i], v.back()); ans[N-B-1] = v[i]; } answer(ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Runtime error | 1 ms | 336 KB | Execution killed with signal 6 |
3 | Halted | 0 ms | 0 KB | - |