Submission #2875720
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef double D; typedef long long int LL; #define st first #define nd second #define pb push_back #define PLL pair <LL, LL> #define PII pair <int, int> const int N = 1e6 + 7; int n, m; int val[N]; PII sosik[N]; PII Union(PII a, PII b){ if(a.st < b.st) swap(a, b); PII ret = {a.st, b.st}; if(b.st < a.nd) ret.nd = a.nd; return ret; } int main(){ scanf("%d", &n); m = 1 << n; for(int i = 0; i < m; ++i) scanf("%d", &val[i]), sosik[i] = {val[i], 0}; for(int i = 0; i < n; ++i) for(int j = 0; j < m; ++j) if(j & (1 << i)) sosik[j] = Union(sosik[j], sosik[j ^ (1 << i)]); int res = 0; for(int i = 1; i < m; ++i){ res = max(res, sosik[i].st + sosik[i].nd); printf("%d\n", res); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Or Plus Max |
User | Anadi |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 829 Byte |
Status | AC |
Exec Time | 69 ms |
Memory | 11264 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:31:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:36:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] sosik[i] = {val[i], 0}; ^
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 | 2304 KB |
sample_02.txt | AC | 2 ms | 2304 KB |
sample_03.txt | AC | 2 ms | 2304 KB |
subtask_1_01.txt | AC | 2 ms | 2304 KB |
subtask_1_02.txt | AC | 2 ms | 2304 KB |
subtask_1_03.txt | AC | 8 ms | 2688 KB |
subtask_1_04.txt | AC | 2 ms | 2304 KB |
subtask_1_05.txt | AC | 2 ms | 2304 KB |
subtask_1_06.txt | AC | 4 ms | 2432 KB |
subtask_1_07.txt | AC | 4 ms | 2432 KB |
subtask_1_08.txt | AC | 2 ms | 2304 KB |
subtask_1_09.txt | AC | 2 ms | 2304 KB |
subtask_1_10.txt | AC | 5 ms | 2560 KB |
subtask_1_11.txt | AC | 1 ms | 2304 KB |
subtask_1_12.txt | AC | 9 ms | 2944 KB |
subtask_1_13.txt | AC | 2 ms | 2304 KB |
subtask_1_14.txt | AC | 68 ms | 11264 KB |
subtask_1_15.txt | AC | 2 ms | 2304 KB |
subtask_1_16.txt | AC | 68 ms | 11264 KB |
subtask_1_17.txt | AC | 57 ms | 9728 KB |
subtask_1_18.txt | AC | 63 ms | 11136 KB |
subtask_1_19.txt | AC | 63 ms | 11264 KB |
subtask_1_20.txt | AC | 67 ms | 11264 KB |
subtask_1_21.txt | AC | 69 ms | 11264 KB |
subtask_1_22.txt | AC | 68 ms | 11264 KB |
subtask_1_23.txt | AC | 68 ms | 11264 KB |
subtask_1_24.txt | AC | 57 ms | 9728 KB |
subtask_1_25.txt | AC | 63 ms | 11136 KB |
subtask_1_26.txt | AC | 63 ms | 11264 KB |
subtask_1_27.txt | AC | 67 ms | 11264 KB |
subtask_1_28.txt | AC | 69 ms | 11264 KB |
subtask_1_29.txt | AC | 68 ms | 11264 KB |