Submission #2009197


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int N, M;
int A[200010], psum[200010], dp[200010];

struct BIT {
    vector<int> tree;
    void init() {
        tree = vector<int>(4*N, -1e9);
    }
    void upd(int idx, int val, int l, int r, int n) {
        if(idx < l || r < idx) return;
        if(l == r) {
            tree[n] = val;
            return;
        }
        int m = (l + r)>>1;
        upd(idx, val, l, m, 2*n);
        upd(idx, val, m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    int quer(int a, int b, int l, int r, int n) {
        if(b < l || r < a) return -1e9;
        if(a <= l && r <= b) return tree[n];
        int m = (l + r)>>1;
        int L = quer(a, b, l, m, 2*n);
        int R = quer(a, b, m + 1, r, 2*n + 1);
        return max(L, R);
    }
} bit;

void solve() {
    bit.init();
    dp[N - 1] = 0;
    for(int i = N - 2; i >= 1; i--) {
        bit.upd(i + 1, -dp[i + 1] + A[i + 1] - psum[i], 0, N - 1, 1);
        dp[i] = bit.quer(i + 1, N - 1, 0, N - 1, 1) + psum[i];
    }
}

int main() {
    scanf("%d", &N);

    for(int i = 0; i < N - 1; i++) {
        scanf("%d", &A[i]);
    }
    for(int i = 0; i < N - 1; i++) {
        psum[i] = A[i];
        if(i) psum[i] += psum[i - 1];
    }

    scanf("%d", &M);

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

        solve();

        printf("%d\n", A[0] - A[1] + dp[1]);
    }
}

Submission Info

Submission Time
Task H - Tokaido
User choikiwon
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1478 Byte
Status TLE
Exec Time 2104 ms
Memory 10896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
                    ^
./Main.cpp:46:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]);
                           ^
./Main.cpp:53:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &M);
                    ^
./Main.cpp:56:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[N - 1]);
                               ^

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 700 / 700 0 / 900
Status
AC × 2
AC × 20
AC × 24
TLE × 15
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 52 ms 5760 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 25 ms 2816 KB
01-05.txt AC 51 ms 5760 KB
01-06.txt AC 51 ms 5760 KB
01-07.txt AC 15 ms 1792 KB
01-08.txt AC 52 ms 5632 KB
01-09.txt AC 52 ms 5760 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 10 ms 1280 KB
01-12.txt AC 50 ms 5504 KB
01-13.txt AC 52 ms 5760 KB
01-14.txt AC 52 ms 5632 KB
01-15.txt AC 52 ms 5760 KB
01-16.txt AC 53 ms 5760 KB
01-17.txt AC 52 ms 5760 KB
01-18.txt AC 52 ms 5760 KB
01-19.txt AC 52 ms 5760 KB
02-01.txt TLE 2103 ms 1664 KB
02-02.txt TLE 2104 ms 8848 KB
02-03.txt TLE 2104 ms 8848 KB
02-04.txt TLE 2104 ms 8848 KB
02-05.txt TLE 2103 ms 384 KB
02-06.txt TLE 2104 ms 10896 KB
02-07.txt TLE 2104 ms 8976 KB
02-08.txt AC 447 ms 1536 KB
02-09.txt TLE 2103 ms 384 KB
02-10.txt TLE 2104 ms 4608 KB
02-11.txt TLE 2104 ms 10896 KB
02-12.txt TLE 2104 ms 8712 KB
02-13.txt TLE 2104 ms 8904 KB
02-14.txt TLE 2104 ms 8904 KB
02-15.txt TLE 2104 ms 8904 KB
02-16.txt TLE 2104 ms 8848 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB