Submission #994057
Source Code Expand
#ifdef DEBUG #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; mt19937 mrand(random_device{} ()); int rnd(int x) { return mrand() % x; } typedef long double ld; typedef long long ll; #ifdef DEBUG #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr) #else #define eprintf(...) ; #endif #define pb push_back #define mp make_pair #define sz(x) ((int) (x).size()) #define TASK "text" const int inf = (int) 1.01e9; const ld eps = 1e-9; const ld pi = acos((ld) -1.0); void precalc() { } int n, m; const int maxn = (int) 2e5 + 10; int a[maxn], qs[maxn]; int read() { if (scanf("%d", &n) < 1) { return 0; } for (int i = 0; i < n - 1; ++i) { scanf("%d", a + i); } scanf("%d", &m); for (int i = 0; i < m; ++i) { scanf("%d", qs + i); } return 1; } int sum[maxn]; int dp[maxn]; void solve() { sum[0] = 0; for (int i = 0; i < n; ++i) { sum[i + 1] = sum[i] + a[i]; } for (int iter = 0; iter < m; ++iter) { a[n - 1] = qs[iter]; sum[n] = sum[n - 1] + a[n - 1]; dp[n - 2] = -a[n - 1]; int cur = -inf; for (int i = n - 2; i >= 0; --i) { if (i < n - 2) { dp[i] = cur + sum[i + 1]; } cur = max(cur, -dp[i] - sum[i + 1]); } printf("%d\n", dp[0] + a[0]); } } int main() { precalc(); #ifdef LOCAL freopen(TASK ".out", "w", stdout); assert(freopen(TASK ".in", "r", stdin)); #endif while (1) { if (!read()) { break; } solve(); #ifdef DEBUG eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC); #endif } return 0; }
Submission Info
Submission Time | |
---|---|
Task | H - Tokaido |
User | XraY |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1682 Byte |
Status | TLE |
Exec Time | 2102 ms |
Memory | 3456 KB |
Compile Error
./Main.cpp: In function ‘int read()’: ./Main.cpp:46:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", a + i); ^ ./Main.cpp:48:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &m); ^ ./Main.cpp:50:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", qs + i); ^
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | 0 / 900 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
dataset1 | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt |
dataset2 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 19 ms | 2560 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 256 KB |
01-04.txt | AC | 10 ms | 1408 KB |
01-05.txt | AC | 19 ms | 2560 KB |
01-06.txt | AC | 19 ms | 2560 KB |
01-07.txt | AC | 7 ms | 896 KB |
01-08.txt | AC | 19 ms | 2560 KB |
01-09.txt | AC | 19 ms | 2560 KB |
01-10.txt | AC | 2 ms | 256 KB |
01-11.txt | AC | 5 ms | 768 KB |
01-12.txt | AC | 19 ms | 2560 KB |
01-13.txt | AC | 19 ms | 2560 KB |
01-14.txt | AC | 19 ms | 2560 KB |
01-15.txt | AC | 19 ms | 2560 KB |
01-16.txt | AC | 19 ms | 2560 KB |
01-17.txt | AC | 19 ms | 2560 KB |
01-18.txt | AC | 19 ms | 2560 KB |
01-19.txt | AC | 19 ms | 2560 KB |
02-01.txt | AC | 1581 ms | 1024 KB |
02-02.txt | TLE | 2102 ms | 3456 KB |
02-03.txt | TLE | 2102 ms | 3328 KB |
02-04.txt | TLE | 2102 ms | 3328 KB |
02-05.txt | AC | 471 ms | 1792 KB |
02-06.txt | TLE | 2102 ms | 3328 KB |
02-07.txt | TLE | 2102 ms | 3328 KB |
02-08.txt | AC | 64 ms | 2432 KB |
02-09.txt | AC | 480 ms | 2304 KB |
02-10.txt | TLE | 2102 ms | 2304 KB |
02-11.txt | TLE | 2102 ms | 3456 KB |
02-12.txt | TLE | 2102 ms | 3328 KB |
02-13.txt | TLE | 2102 ms | 3456 KB |
02-14.txt | TLE | 2102 ms | 3456 KB |
02-15.txt | TLE | 2102 ms | 3456 KB |
02-16.txt | TLE | 2102 ms | 3456 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |