Submission #2781693
Source Code Expand
/** * File : E.cpp * Author : Kazune Takahashi * Created : 2018-7-1 22:00:11 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <random> // random_device rd; mt19937 mt(rd()); #include <chrono> // std::chrono::system_clock::time_point start_time, end_time; // start = std::chrono::system_clock::now(); // double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count(); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; const int M = (1 << 18); typedef tuple<int, int> D; int N; int A[M]; set<D> DP[20][M]; int main() { cin >> N; for (auto i = 0; i < (1 << N); i++) { cin >> A[i]; } for (auto i = 0; i < (1 << N); i++) { DP[0][i].insert(D(-A[i], i)); } for (auto i = 1; i <= N; i++) { for (auto j = 0; j < (1 << N); j++) { auto it = DP[i - 1][j].begin(); DP[i][j].insert(*it); it++; if (it != DP[i - 1][j].end()) { DP[i][j].insert(*it); } if ((j >> (i - 1)) & 1) { it = DP[i][j - (1 << (i - 1))].begin(); DP[i][j].insert(*it); it++; if (it != DP[i][j - (1 << (i - 1))].end()) { DP[i][j].insert(*it); } } /* cerr << "DP[" << i << "][" << j << "] = "; for (auto e : DP[i][j]) { cerr << "(" << -get<0>(e) << ", " << get<1>(e) << ") "; } cerr << endl; */ } } int ans = 0; for (auto i = 1; i < (1 << N); i++) { int tmp = 0; auto it = DP[N][i].begin(); tmp += -get<0>(*it); it++; tmp += -get<0>(*it); ans = max(ans, tmp); cout << ans << endl; } }
Submission Info
Submission Time | |
---|---|
Task | E - Or Plus Max |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 2328 Byte |
Status | AC |
Exec Time | 1722 ms |
Memory | 888832 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 89 ms | 246016 KB |
sample_02.txt | AC | 89 ms | 246016 KB |
sample_03.txt | AC | 89 ms | 246016 KB |
subtask_1_01.txt | AC | 89 ms | 246016 KB |
subtask_1_02.txt | AC | 89 ms | 246144 KB |
subtask_1_03.txt | AC | 255 ms | 312320 KB |
subtask_1_04.txt | AC | 94 ms | 247424 KB |
subtask_1_05.txt | AC | 89 ms | 246016 KB |
subtask_1_06.txt | AC | 130 ms | 260352 KB |
subtask_1_07.txt | AC | 130 ms | 260352 KB |
subtask_1_08.txt | AC | 90 ms | 246144 KB |
subtask_1_09.txt | AC | 89 ms | 246016 KB |
subtask_1_10.txt | AC | 169 ms | 276864 KB |
subtask_1_11.txt | AC | 89 ms | 246016 KB |
subtask_1_12.txt | AC | 261 ms | 312576 KB |
subtask_1_13.txt | AC | 91 ms | 246656 KB |
subtask_1_14.txt | AC | 1678 ms | 888832 KB |
subtask_1_15.txt | AC | 89 ms | 246016 KB |
subtask_1_16.txt | AC | 1675 ms | 888832 KB |
subtask_1_17.txt | AC | 1601 ms | 887296 KB |
subtask_1_18.txt | AC | 1616 ms | 888704 KB |
subtask_1_19.txt | AC | 1619 ms | 888832 KB |
subtask_1_20.txt | AC | 1722 ms | 888832 KB |
subtask_1_21.txt | AC | 1663 ms | 888832 KB |
subtask_1_22.txt | AC | 1678 ms | 888832 KB |
subtask_1_23.txt | AC | 1660 ms | 888832 KB |
subtask_1_24.txt | AC | 1624 ms | 887296 KB |
subtask_1_25.txt | AC | 1629 ms | 888704 KB |
subtask_1_26.txt | AC | 1636 ms | 888832 KB |
subtask_1_27.txt | AC | 1660 ms | 888832 KB |
subtask_1_28.txt | AC | 1666 ms | 888832 KB |
subtask_1_29.txt | AC | 1675 ms | 888832 KB |