Submission #8935256
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int N=(1<<18); int n, a[N+10]; pair<int,int> f[N+10]; inline void up(pair<int,int> &a,pair<int,int> b){ if (b.second>=a.first){ a=b; } else if (b.first>=a.first){ a.second=a.first; a.first=b.first; } else if (b.first<a.first && b.first>=a.second){ a.second=b.first; } } int main(){ cin>>n; for (int i=0;i<(1<<n);++i){ scanf("%d", &a[i]); f[i].first=a[i]; } for (int i=0;i<n;i++){ for (int j=0;j<(1<<n);j++){ if (j&(1<<i)) up(f[j], f[j^(1<<i)]); } } int ans=0; for (int i=1;i<(1<<n);++i){ ans=max(ans, f[i].first+f[i].second); printf("%d\n", ans); } }
Submission Info
Submission Time | |
---|---|
Task | E - Or Plus Max |
User | Dbenyong |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 783 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 6144 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:21:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 9 ms | 768 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 3 ms | 384 KB |
subtask_1_07.txt | AC | 3 ms | 384 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 5 ms | 512 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 9 ms | 1024 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 73 ms | 6144 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_16.txt | AC | 73 ms | 6144 KB |
subtask_1_17.txt | AC | 62 ms | 4608 KB |
subtask_1_18.txt | AC | 62 ms | 6016 KB |
subtask_1_19.txt | AC | 63 ms | 6144 KB |
subtask_1_20.txt | AC | 71 ms | 6144 KB |
subtask_1_21.txt | AC | 74 ms | 6144 KB |
subtask_1_22.txt | AC | 75 ms | 6144 KB |
subtask_1_23.txt | AC | 73 ms | 6144 KB |
subtask_1_24.txt | AC | 62 ms | 4608 KB |
subtask_1_25.txt | AC | 63 ms | 6016 KB |
subtask_1_26.txt | AC | 64 ms | 6144 KB |
subtask_1_27.txt | AC | 72 ms | 6144 KB |
subtask_1_28.txt | AC | 74 ms | 6144 KB |
subtask_1_29.txt | AC | 73 ms | 6144 KB |