Submission #67318744


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

void solve() {
    int N;
    cin >> N;
    vector<int> A(1 << N);
    for(int &x : A) cin >> x;
    auto rec = [&](auto rec, int l, int r) -> vector<int> {
        if(l + 1 == r) return vector<int>{A[l]};
        int m = (l + r) / 2;
        vector<int> L = rec(rec, l, m);
        vector<int> R = rec(rec, m, r);
        if(L > R) swap(L, R);
        L.insert(L.end(), R.begin(), R.end());
        return L;
    };
    A = rec(rec, 0, 1 << N);
    for(int x : A) cout << x << " "; cout << endl;
}

int main() {
    int T;
    cin >> T;
    while(T--) solve();
}

Submission Info

Submission Time
Task E - Reverse 2^i
User ripity
Language C++ 20 (gcc 12.2)
Score 450
Code Size 745 Byte
Status AC
Exec Time 171 ms
Memory 6404 KiB

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:25:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   25 |     for(int x : A) cout << x << " "; cout << endl;
      |     ^~~
Main.cpp:25:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   25 |     for(int x : A) cout << x << " "; cout << endl;
      |                                      ^~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 1
AC × 26
Set Name Test Cases
Sample 00_sample_00.txt
All 00_sample_00.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3600 KiB
01_test_00.txt AC 1 ms 3508 KiB
01_test_01.txt AC 1 ms 3512 KiB
01_test_02.txt AC 101 ms 3516 KiB
01_test_03.txt AC 9 ms 3472 KiB
01_test_04.txt AC 71 ms 3500 KiB
01_test_05.txt AC 69 ms 3516 KiB
01_test_06.txt AC 69 ms 3536 KiB
01_test_07.txt AC 67 ms 3504 KiB
01_test_08.txt AC 75 ms 3720 KiB
01_test_09.txt AC 78 ms 3768 KiB
01_test_10.txt AC 75 ms 3700 KiB
01_test_11.txt AC 85 ms 6332 KiB
01_test_12.txt AC 81 ms 4984 KiB
01_test_13.txt AC 78 ms 4012 KiB
01_test_14.txt AC 171 ms 3808 KiB
01_test_15.txt AC 71 ms 6300 KiB
01_test_16.txt AC 73 ms 6200 KiB
01_test_17.txt AC 73 ms 6172 KiB
01_test_18.txt AC 83 ms 6404 KiB
01_test_19.txt AC 76 ms 6256 KiB
01_test_20.txt AC 76 ms 6208 KiB
01_test_21.txt AC 75 ms 6204 KiB
01_test_22.txt AC 75 ms 6204 KiB
01_test_23.txt AC 73 ms 6168 KiB
01_test_24.txt AC 73 ms 6260 KiB