Submission #998964
Source Code Expand
#include<bits/stdc++.h> #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3f #define MOD 1000000007 #define EPS (1e-10) #define rep(i,n)for(int i=0;i<n;i++) using namespace std; typedef long long ll; typedef pair<int, int>P; int main() { int n; scanf("%d", &n); int d = 1 << n; vector<int>v(d); rep(i, d)scanf("%d", &v[i]); while (v.size() > 1) { for (int i = 0; i < v.size(); i += 2) { if (v[i] < v[i + 1]) { v[i + 1] -= v[i]; v[i] = -1; } else if (v[i] > v[i + 1]) { v[i] -= v[i + 1]; v[i + 1] = -1; } else { v[i] = -1; } } v.erase(remove(v.begin(), v.end(), -1), v.end()); } printf("%d\n", v[0]); }
Submission Info
Submission Time | |
---|---|
Task | C - Kode Festival |
User | autumn_eel |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 687 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 1408 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int n; scanf("%d", &n); ^ ./Main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i, d)scanf("%d", &v[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 | 2 ms | 256 KB |
sample_02.txt | AC | 2 ms | 256 KB |
subtask1_01.txt | AC | 2 ms | 384 KB |
subtask1_02.txt | AC | 2 ms | 256 KB |
subtask1_03.txt | AC | 2 ms | 256 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 4 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 7 ms | 384 KB |
subtask1_08.txt | AC | 19 ms | 768 KB |
subtask1_09.txt | AC | 2 ms | 256 KB |
subtask1_10.txt | AC | 35 ms | 1280 KB |
subtask1_11.txt | AC | 35 ms | 1280 KB |
subtask1_12.txt | AC | 35 ms | 1280 KB |
subtask1_13.txt | AC | 35 ms | 1280 KB |
subtask1_14.txt | AC | 36 ms | 1408 KB |
subtask1_15.txt | AC | 35 ms | 1280 KB |
subtask1_16.txt | AC | 36 ms | 1280 KB |
subtask1_17.txt | AC | 35 ms | 1280 KB |
subtask1_18.txt | AC | 35 ms | 1280 KB |
subtask1_19.txt | AC | 35 ms | 1280 KB |