Submission #1004660
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }
int main() {
int N;
while(~scanf("%d", &N)) {
vector<int> A(1 << N);
for(int i = 0; i < 1 << N; ++ i)
scanf("%d", &A[i]);
rep(k, N) {
vi nA(1 << (N - k - 1));
rep(i, 1 << (N - k - 1)) {
int X = A[i * 2 + 0], Y = A[i * 2 + 1];
if(X == Y)
nA[i] = X;
else
nA[i] = max(X, Y) - min(X, Y);
}
A.swap(nA);
}
int ans = A[0];
printf("%d\n", ans);
}
return 0;
}
Submission Info
Submission Time
2016-12-01 18:06:56+0900
Task
C - Kode Festival
User
anta
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1018 Byte
Status
AC
Exec Time
36 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:22: 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
100 / 100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
3 ms
256 KB
sample_02.txt
AC
3 ms
256 KB
subtask1_01.txt
AC
3 ms
256 KB
subtask1_02.txt
AC
3 ms
256 KB
subtask1_03.txt
AC
3 ms
256 KB
subtask1_04.txt
AC
3 ms
256 KB
subtask1_05.txt
AC
5 ms
384 KB
subtask1_06.txt
AC
3 ms
256 KB
subtask1_07.txt
AC
7 ms
384 KB
subtask1_08.txt
AC
19 ms
1024 KB
subtask1_09.txt
AC
3 ms
256 KB
subtask1_10.txt
AC
36 ms
1792 KB
subtask1_11.txt
AC
36 ms
1792 KB
subtask1_12.txt
AC
36 ms
1792 KB
subtask1_13.txt
AC
36 ms
1792 KB
subtask1_14.txt
AC
36 ms
1792 KB
subtask1_15.txt
AC
36 ms
1792 KB
subtask1_16.txt
AC
36 ms
1792 KB
subtask1_17.txt
AC
36 ms
1792 KB
subtask1_18.txt
AC
36 ms
1792 KB
subtask1_19.txt
AC
36 ms
1792 KB