Submission #349097
Source Code Expand
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
typedef long long ll;
template <int N>
struct FenwickTree {
ll seg[N];
void init() {
fill_n(seg, N, 0);
}
void add(int i, ll x) {
while (i < N) {
seg[i] += x;
i += (i+1) & ~i;
}
}
//[0, i)
ll sum(int i) {
ll s = 0;
int d = 1;
while (i >= d) {
i -= d;
s += seg[i];
d = (i+1) & ~i;
}
return s;
}
//[a, b)
ll sum(int a, int b) {
return sum(b) - sum(a);
}
};
const int MN = 100200;
FenwickTree<MN> fw;
//int d[MN];
ll r;
int set(int i, int x) {
}
int sum() {
}
void input() {
int n;
ll *s = new ll[MN*2];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", s+i);
}
r = 0;
if (n % 2) {
s[n] = 1LL<<55;
r -= 1LL<<55;
n++;
}
r += s[0];
s[0] = 0;
fw.init();
for (int i = 0; i < n/2; i++) {
fw.add(i, s[i*2]);
}
ll mi = 1LL<<55;
for (int i = n-1; i >= 0; i--) {
if (!(i % 2)) {
r += max(s[i], mi);
}
mi = min(mi, s[i]);
}
}
int main() {
input();
printf("%lld\n", r);
int q;
scanf("%d", &q);
assert(!q);
for (int i = 0; i < q; i++) {
int p; ll d;
scanf("%d %lld", &p, &d);
}
}
Submission Info
Submission Time
2015-03-04 01:35:26+0900
Task
D - コインの取り合い
User
yosupo
Language
C++11 (GCC 4.8.1)
Score
10
Code Size
1570 Byte
Status
RE
Exec Time
340 ms
Memory
3740 KB
Compile Error
./Main.cpp: In function ‘void input()’:
./Main.cpp:61:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:63:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", s+i);
^
./Main.cpp: In function ‘int main()’:
./Main.cpp:92:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
^
./Main.cpp:96:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %lld", &p, &d);
^
Judge Result
Set Name
Sample
Subtask1
Subtask2
Subtask3
Score / Max Score
0 / 0
10 / 10
0 / 80
0 / 90
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
Subtask1
subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt
Subtask2
sample_01.txt, sample_02.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Subtask3
subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
RE
278 ms
2020 KB
sample_02.txt
RE
281 ms
2056 KB
subtask1_01.txt
AC
29 ms
2020 KB
subtask1_02.txt
AC
78 ms
3552 KB
subtask1_03.txt
AC
64 ms
3172 KB
subtask1_04.txt
AC
77 ms
3552 KB
subtask1_05.txt
AC
78 ms
3548 KB
subtask1_06.txt
AC
61 ms
3548 KB
subtask1_07.txt
AC
78 ms
3548 KB
subtask2_01.txt
RE
283 ms
2016 KB
subtask2_02.txt
RE
294 ms
2780 KB
subtask2_03.txt
RE
323 ms
3712 KB
subtask2_04.txt
RE
314 ms
3680 KB
subtask2_05.txt
RE
313 ms
3680 KB
subtask2_06.txt
RE
312 ms
3680 KB
subtask2_07.txt
RE
314 ms
3552 KB
subtask2_08.txt
AC
61 ms
3548 KB
subtask2_09.txt
RE
286 ms
2528 KB
subtask2_10.txt
RE
314 ms
3552 KB
subtask2_11.txt
RE
312 ms
3556 KB
subtask2_12.txt
RE
316 ms
3680 KB
subtask3_01.txt
RE
288 ms
2404 KB
subtask3_02.txt
RE
321 ms
3684 KB
subtask3_03.txt
RE
321 ms
3684 KB
subtask3_04.txt
RE
322 ms
3680 KB
subtask3_05.txt
AC
61 ms
3552 KB
subtask3_06.txt
RE
327 ms
3556 KB
subtask3_07.txt
RE
322 ms
3556 KB
subtask3_08.txt
RE
322 ms
3740 KB
subtask3_09.txt
RE
337 ms
3552 KB
subtask3_10.txt
RE
318 ms
3732 KB
subtask3_11.txt
RE
302 ms
3016 KB
subtask3_12.txt
RE
330 ms
3684 KB
subtask3_13.txt
RE
340 ms
3556 KB
subtask3_14.txt
RE
337 ms
3568 KB