Submission #3880513


Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 1<<18;

pii D[MX];
int A[MX];

int main()
{
	int N;
	scanf("%d", &N);
	for(int i = 0; i < 1<<N; i++){
		scanf("%d", A+i);
		D[i] = pii(A[i], -1);
	}
	for(int i = 0; i < N; i++){
		for(int j = 0; j < 1<<N; j++){
			if(j&1<<i) continue;
			pii u = D[j], v = D[j|1<<i], w;
			if(u.first > v.first) w = pii(u.first, max(u.second, v.first));
			else w = pii(v.first, max(v.second, u.first));
			D[j|1<<i] = w;
		}
	}
	int ans = 0;
	for(int i = 1; i < 1<<N; i++){
		ans = max(ans, D[i].first + D[i].second);
		printf("%d\n", ans);
	}
}

Submission Info

Submission Time
Task E - Or Plus Max
User zigui
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1829 Byte
Status AC
Exec Time 69 ms
Memory 6272 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:62:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:64:19: 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
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 KiB
sample_02.txt AC 1 ms 256 KiB
sample_03.txt AC 1 ms 256 KiB
subtask_1_01.txt AC 1 ms 256 KiB
subtask_1_02.txt AC 1 ms 256 KiB
subtask_1_03.txt AC 8 ms 768 KiB
subtask_1_04.txt AC 1 ms 256 KiB
subtask_1_05.txt AC 1 ms 256 KiB
subtask_1_06.txt AC 3 ms 384 KiB
subtask_1_07.txt AC 3 ms 384 KiB
subtask_1_08.txt AC 1 ms 256 KiB
subtask_1_09.txt AC 1 ms 256 KiB
subtask_1_10.txt AC 5 ms 512 KiB
subtask_1_11.txt AC 1 ms 256 KiB
subtask_1_12.txt AC 9 ms 1024 KiB
subtask_1_13.txt AC 1 ms 256 KiB
subtask_1_14.txt AC 69 ms 6144 KiB
subtask_1_15.txt AC 1 ms 256 KiB
subtask_1_16.txt AC 68 ms 6144 KiB
subtask_1_17.txt AC 57 ms 4608 KiB
subtask_1_18.txt AC 62 ms 6016 KiB
subtask_1_19.txt AC 62 ms 6272 KiB
subtask_1_20.txt AC 68 ms 6144 KiB
subtask_1_21.txt AC 69 ms 6144 KiB
subtask_1_22.txt AC 69 ms 6144 KiB
subtask_1_23.txt AC 68 ms 6144 KiB
subtask_1_24.txt AC 57 ms 4608 KiB
subtask_1_25.txt AC 61 ms 6016 KiB
subtask_1_26.txt AC 62 ms 6144 KiB
subtask_1_27.txt AC 67 ms 6144 KiB
subtask_1_28.txt AC 68 ms 6144 KiB
subtask_1_29.txt AC 68 ms 6144 KiB