Submission #646106

#TimeUsernameProblemLanguageResultExecution timeMemory
646106ghostwriterBuilding 4 (JOI20_building4)C++14
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug.h> #else #define debug(...) #endif #define ft front #define bk back #define st first #define nd second #define ins insert #define ers erase #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 bg begin #define ed end #define all(x) (x).bg(), (x).ed() #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 FRN(i, n) for (int (i) = 0; (i) < (n); ++(i)) #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(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); } /* ---------------------------------------------------------------- END OF TEMPLATE ---------------------------------------------------------------- Tran The Bao - ghostwriter Training for VOI23 gold medal ---------------------------------------------------------------- DIT ME CHUYEN BAO LOC ---------------------------------------------------------------- */ const int N = 1e6 + 1; int n, a[N], b[N]; signed main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); // freopen(file".inp", "r", stdin); // freopen(file".out", "w", stdout); cin >> n; FOR(i, 1, 2 * n) cin >> a[i]; FOR(i, 1, 2 * n) cin >> b[i]; FOR(i, 1, (1 << (2 * n)) - 1) { int cnt = __builtin_popcount(i); if (cnt != n) continue; FOR(j, 0, 2 * n - 1) if (i & (1 << j)) swap(a[j + 1], b[j + 1]); bool ok = 1; FOR(j, 2, 2 * n) if (a[j] < a[j - 1]) ok = 0; if (!ok) { FOR(j, 0, 2 * n - 1) if (i & (1 << j)) swap(a[j + 1], b[j + 1]); continue; } FOR(j, 0, 2 * n - 1) if (i & (1 << j)) cout << 'B'; else cout << 'A'; return 0; } cout << -1; return 0; } /* 3 2 5 4 9 15 11 6 7 6 8 12 14 ---------------------------------------------------------------- From Benq: stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN * DON'T GET STUCK ON ONE APPROACH ---------------------------------------------------------------- */

Compilation message (stderr)

building4.cpp: In function 'int main()':
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:58:5: note: in expansion of macro 'FOR'
   58 |     FOR(i, 1, 2 * n) cin >> a[i];
      |     ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:59:5: note: in expansion of macro 'FOR'
   59 |     FOR(i, 1, 2 * n) cin >> b[i];
      |     ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:60:5: note: in expansion of macro 'FOR'
   60 |     FOR(i, 1, (1 << (2 * n)) - 1) {
      |     ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:63:6: note: in expansion of macro 'FOR'
   63 |      FOR(j, 0, 2 * n - 1)
      |      ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:67:6: note: in expansion of macro 'FOR'
   67 |      FOR(j, 2, 2 * n)
      |      ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:71:7: note: in expansion of macro 'FOR'
   71 |       FOR(j, 0, 2 * n - 1)
      |       ^~~
building4.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
building4.cpp:76:6: note: in expansion of macro 'FOR'
   76 |      FOR(j, 0, 2 * n - 1)
      |      ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...