# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
638382 | 2022-09-05T17:34:49 Z | ghostwriter | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 3 ms | 504 KB |
#include <vector> #include "messy.h" #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #include "grader.cpp" #endif #define st first #define nd second #define pb push_back #define pf push_front #define _pb pop_back #define _pf pop_front #define lb lower_bound #define ub upper_bound #define mtp make_tuple #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair<int, int> pi; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; typedef string str; template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); } template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; } #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i)) #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i)) #define EACH(i, x) for (auto &(i) : (x)) #define WHILE while #define file "TEST" mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); } /* Tran The Bao CTL - Da Lat Cay ngay cay dem nhung deo duoc cong nhan */ vi ans, ans1; void add(int n, int l, int r) { if (l == r) return; str s(n, '1'); FOR(i, l, r) s[i] = '0'; int m = l + (r - l + 1) / 2 - 1; FOR(i, l, m) { str cur = s; cur[i] = '1'; add_element(cur); } add(n, l, m); add(n, m + 1, r); } void cal(int l, int r, str s) { if (l == r) { FOR(i, 0, sz(s) - 1) if (s[i] == '0') ans[l] = i; return; } vi a1, a2; FOR(i, 0, sz(s) - 1) { if (s[i] == '1') continue; str cur = s; cur[i] = '1'; if (check_element(cur)) a2.pb(i); else a1.pb(i); } str s1 = s, s2 = s; EACH(i, a1) s1[i] = '1'; EACH(i, a2) s2[i] = '1'; int mid = l + (r - l + 1) / 2 - 1; cal(l, mid, s1); cal(mid + 1, r, s2); } std::vector<int> restore_permutation(int n, int w, int r) { add(n, 0, n - 1); compile_set(); str s(n, '0'); ans.resize(n, 0); ans1.resize(n, 0); cal(0, n - 1, s); FOR(i, 0, n - 1) ans1[ans[i]] = i; return ans1; } /* 4 16 16 2 1 3 0 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 296 KB | n = 8 |
2 | Correct | 1 ms | 304 KB | n = 8 |
3 | Correct | 1 ms | 212 KB | n = 8 |
4 | Correct | 0 ms | 212 KB | n = 8 |
5 | Correct | 0 ms | 212 KB | n = 8 |
6 | Correct | 1 ms | 212 KB | n = 8 |
7 | Correct | 0 ms | 300 KB | n = 8 |
8 | Correct | 1 ms | 304 KB | n = 8 |
9 | Correct | 1 ms | 256 KB | n = 8 |
10 | Correct | 1 ms | 212 KB | n = 8 |
11 | Correct | 1 ms | 212 KB | n = 8 |
12 | Correct | 1 ms | 212 KB | n = 8 |
13 | Correct | 1 ms | 212 KB | n = 8 |
14 | Correct | 1 ms | 308 KB | n = 8 |
15 | Correct | 1 ms | 212 KB | n = 8 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 300 KB | n = 32 |
2 | Correct | 1 ms | 212 KB | n = 32 |
3 | Correct | 0 ms | 212 KB | n = 32 |
4 | Correct | 1 ms | 308 KB | n = 32 |
5 | Correct | 0 ms | 212 KB | n = 32 |
6 | Correct | 1 ms | 212 KB | n = 32 |
7 | Correct | 0 ms | 212 KB | n = 32 |
8 | Correct | 0 ms | 212 KB | n = 32 |
9 | Correct | 1 ms | 296 KB | n = 32 |
10 | Correct | 1 ms | 212 KB | n = 32 |
11 | Correct | 1 ms | 292 KB | n = 32 |
12 | Correct | 1 ms | 212 KB | n = 32 |
13 | Correct | 1 ms | 212 KB | n = 32 |
14 | Correct | 1 ms | 212 KB | n = 32 |
15 | Correct | 1 ms | 300 KB | n = 32 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | n = 32 |
2 | Correct | 1 ms | 212 KB | n = 32 |
3 | Correct | 1 ms | 212 KB | n = 32 |
4 | Correct | 1 ms | 304 KB | n = 32 |
5 | Correct | 1 ms | 212 KB | n = 32 |
6 | Correct | 1 ms | 212 KB | n = 32 |
7 | Correct | 1 ms | 304 KB | n = 32 |
8 | Correct | 1 ms | 212 KB | n = 32 |
9 | Correct | 1 ms | 304 KB | n = 32 |
10 | Correct | 1 ms | 212 KB | n = 32 |
11 | Correct | 1 ms | 304 KB | n = 32 |
12 | Correct | 1 ms | 212 KB | n = 32 |
13 | Correct | 1 ms | 212 KB | n = 32 |
14 | Correct | 1 ms | 212 KB | n = 32 |
15 | Correct | 1 ms | 212 KB | n = 32 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 468 KB | n = 128 |
2 | Correct | 2 ms | 432 KB | n = 128 |
3 | Correct | 2 ms | 468 KB | n = 128 |
4 | Correct | 2 ms | 432 KB | n = 128 |
5 | Correct | 2 ms | 504 KB | n = 128 |
6 | Correct | 2 ms | 436 KB | n = 128 |
7 | Correct | 2 ms | 468 KB | n = 128 |
8 | Correct | 2 ms | 468 KB | n = 128 |
9 | Correct | 1 ms | 468 KB | n = 128 |
10 | Correct | 2 ms | 468 KB | n = 128 |
11 | Correct | 2 ms | 468 KB | n = 128 |
12 | Correct | 1 ms | 468 KB | n = 128 |
13 | Correct | 2 ms | 468 KB | n = 128 |
14 | Correct | 2 ms | 468 KB | n = 128 |
15 | Correct | 2 ms | 428 KB | n = 128 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 432 KB | n = 128 |
2 | Correct | 1 ms | 428 KB | n = 128 |
3 | Correct | 2 ms | 468 KB | n = 128 |
4 | Correct | 2 ms | 468 KB | n = 128 |
5 | Correct | 3 ms | 468 KB | n = 128 |
6 | Correct | 2 ms | 468 KB | n = 128 |
7 | Correct | 2 ms | 468 KB | n = 128 |
8 | Correct | 2 ms | 468 KB | n = 128 |
9 | Correct | 2 ms | 432 KB | n = 128 |
10 | Correct | 3 ms | 468 KB | n = 128 |
11 | Correct | 2 ms | 428 KB | n = 128 |
12 | Correct | 3 ms | 432 KB | n = 128 |
13 | Correct | 2 ms | 468 KB | n = 128 |
14 | Correct | 2 ms | 468 KB | n = 128 |
15 | Correct | 2 ms | 468 KB | n = 128 |