Submission #8928136
Source Code Expand
//#include "debug.h" #include <string.h> #include <limits.h> #include <map> #include <set> #include <vector> #include <algorithm> using namespace std; #define MAXN (1<<18) int n, m; int a[MAXN]; pair<int,int> s[MAXN][2]; int input() { if (scanf("%d", &n) < 0) return 0; m = (1<<n); for (int i=0; i<m; i++) scanf("%d", &a[i]); return 1; } void init() { memset(s, 0, sizeof(s)); } void merge(int i, int j) { pair<int,int> x[4] = {s[i][0], s[i][1], s[j][0], s[j][1]}; sort(x, x+4); int k = unique(x, x+4)-x; //p(k, x[0], x[1], x[2], x[3]); s[i][0] = x[k-1]; s[i][1] = x[k-2]; } long solve() { for (int i=0; i<m; i++) s[i][0] = {a[i], i}; for (int k=0; k<n; k++) { int b = (1<<k); for (int i=0; i<m; i++) if ((i&b)==0) merge(i|b, i); } return 1; } void output(long ans) { long x = 0; for (int i=1; i<m; i++) { //p(s[i][0], s[i][1]); x = max(x, long(s[i][0].first)+s[i][1].first); printf("%ld\n", x); } } void cleanup() { } int main() { while (input()) { init(); output(solve()); cleanup(); //break; } }
Submission Info
Submission Time | |
---|---|
Task | E - Or Plus Max |
User | mikuz |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1057 Byte |
Status | AC |
Exec Time | 123 ms |
Memory | 8064 KB |
Compile Error
./Main.cpp: In function ‘int input()’: ./Main.cpp:19:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i=0; i<m; i++) scanf("%d", &a[i]); ^
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 | 2 ms | 4224 KB |
sample_02.txt | AC | 2 ms | 4224 KB |
sample_03.txt | AC | 2 ms | 4224 KB |
subtask_1_01.txt | AC | 2 ms | 4224 KB |
subtask_1_02.txt | AC | 2 ms | 4224 KB |
subtask_1_03.txt | AC | 14 ms | 4608 KB |
subtask_1_04.txt | AC | 2 ms | 4224 KB |
subtask_1_05.txt | AC | 2 ms | 4224 KB |
subtask_1_06.txt | AC | 5 ms | 4352 KB |
subtask_1_07.txt | AC | 5 ms | 4352 KB |
subtask_1_08.txt | AC | 2 ms | 4224 KB |
subtask_1_09.txt | AC | 2 ms | 4224 KB |
subtask_1_10.txt | AC | 8 ms | 4352 KB |
subtask_1_11.txt | AC | 2 ms | 4224 KB |
subtask_1_12.txt | AC | 13 ms | 4736 KB |
subtask_1_13.txt | AC | 2 ms | 4224 KB |
subtask_1_14.txt | AC | 122 ms | 8064 KB |
subtask_1_15.txt | AC | 2 ms | 4224 KB |
subtask_1_16.txt | AC | 122 ms | 8064 KB |
subtask_1_17.txt | AC | 113 ms | 6528 KB |
subtask_1_18.txt | AC | 101 ms | 7936 KB |
subtask_1_19.txt | AC | 102 ms | 8064 KB |
subtask_1_20.txt | AC | 121 ms | 8064 KB |
subtask_1_21.txt | AC | 122 ms | 8064 KB |
subtask_1_22.txt | AC | 123 ms | 8064 KB |
subtask_1_23.txt | AC | 122 ms | 8064 KB |
subtask_1_24.txt | AC | 113 ms | 6528 KB |
subtask_1_25.txt | AC | 102 ms | 7936 KB |
subtask_1_26.txt | AC | 102 ms | 8064 KB |
subtask_1_27.txt | AC | 122 ms | 8064 KB |
subtask_1_28.txt | AC | 122 ms | 8064 KB |
subtask_1_29.txt | AC | 123 ms | 8064 KB |