Submission #3604843


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

int N, A[1 << 18];
pair<int, int> zeta[1 << 18];

pair<int, int> update_best(pair<int, int> &a, pair<int, int> &b)
{
	if (a.first < b.first) return update_best(b, a);
	return make_pair(a.first, max(a.second, b.first));
}

int main()
{
	scanf("%d", &N);
	for (int i = 0; i < (1 << N); ++i) scanf("%d", A + i);

	for (int i = 0; i < (1 << N); ++i) zeta[i] = make_pair(A[i], 0);
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < (1 << N); ++j) {
			int k = j | (1 << i);
			if (k != j) zeta[k] = update_best(zeta[j], zeta[k]);
		}
	}

	int ret = 0;
	for (int i = 1; i < (1 << N); ++i) {
		ret = max(ret, zeta[i].first + zeta[i].second);
		printf("%d\n", ret);
	}

	return 0;
}

Submission Info

Submission Time
Task E - Or Plus Max
User semiexp
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1081 Byte
Status AC
Exec Time 73 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:29:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < (1 << N); ++i) scanf("%d", A + i);
                                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 35
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 8 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 10 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 61 ms 4608 KB
subtask_1_18.txt AC 68 ms 6016 KB
subtask_1_19.txt AC 69 ms 6144 KB
subtask_1_20.txt AC 71 ms 6144 KB
subtask_1_21.txt AC 73 ms 6144 KB
subtask_1_22.txt AC 73 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 69 ms 6016 KB
subtask_1_26.txt AC 69 ms 6144 KB
subtask_1_27.txt AC 71 ms 6144 KB
subtask_1_28.txt AC 73 ms 6144 KB
subtask_1_29.txt AC 73 ms 6144 KB