Submission #1692642
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
int n,a[100010],F,G,ty;
char op[100010];
void work()
{
scanf("%d %d",&n,&a[1]);
for (int i=2; i<=n; i++)
{
do op[i]=getchar(); while ((op[i]!='+')&&(op[i]!='-'));
scanf("%d",&a[i]);
}
F=G=a[1],ty=0;
for (int i=2; i<=n; i++)
if (op[i]=='+')
{
if (ty) F-=a[i],G+=a[i]; else F+=a[i],G-=a[i];
G=max(F,G);
}else
{
if (ty) F+=a[i],G-=a[i]; else F-=a[i],G+=a[i];
G=max(F,G),ty^=1;
}
printf("%d\n",G);
}
int main()
{
work();
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘void work()’:
./Main.cpp:9:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&a[1]);
^
./Main.cpp:13:21: 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 |
0 / 900 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_alladd_01.txt, subtask_1_alladd_02.txt, subtask_1_alladd_03.txt, subtask_1_alladd_04.txt, subtask_1_allsub_01.txt, subtask_1_allsub_02.txt, subtask_1_allsub_03.txt, subtask_1_allsub_04.txt, subtask_1_cont_01.txt, subtask_1_cont_02.txt, subtask_1_cont_03.txt, subtask_1_cont_04.txt, subtask_1_killer_01.txt, subtask_1_killer_02.txt, subtask_1_killer_03.txt, subtask_1_killer_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_03.txt, subtask_1_max_04.txt, subtask_1_min_01.txt, subtask_1_min_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_alladd_01.txt |
WA |
15 ms |
768 KB |
subtask_1_alladd_02.txt |
WA |
15 ms |
768 KB |
subtask_1_alladd_03.txt |
WA |
15 ms |
768 KB |
subtask_1_alladd_04.txt |
WA |
15 ms |
768 KB |
subtask_1_allsub_01.txt |
WA |
15 ms |
768 KB |
subtask_1_allsub_02.txt |
WA |
15 ms |
768 KB |
subtask_1_allsub_03.txt |
WA |
15 ms |
768 KB |
subtask_1_allsub_04.txt |
WA |
15 ms |
768 KB |
subtask_1_cont_01.txt |
WA |
9 ms |
512 KB |
subtask_1_cont_02.txt |
WA |
7 ms |
512 KB |
subtask_1_cont_03.txt |
WA |
6 ms |
384 KB |
subtask_1_cont_04.txt |
WA |
2 ms |
256 KB |
subtask_1_killer_01.txt |
WA |
14 ms |
768 KB |
subtask_1_killer_02.txt |
WA |
10 ms |
512 KB |
subtask_1_killer_03.txt |
WA |
14 ms |
768 KB |
subtask_1_killer_04.txt |
WA |
10 ms |
512 KB |
subtask_1_max_01.txt |
WA |
15 ms |
768 KB |
subtask_1_max_02.txt |
WA |
15 ms |
768 KB |
subtask_1_max_03.txt |
WA |
15 ms |
768 KB |
subtask_1_max_04.txt |
WA |
15 ms |
768 KB |
subtask_1_min_01.txt |
AC |
1 ms |
256 KB |
subtask_1_min_02.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_01.txt |
WA |
10 ms |
512 KB |
subtask_1_rand_02.txt |
WA |
11 ms |
640 KB |
subtask_1_rand_03.txt |
WA |
2 ms |
256 KB |
subtask_1_rand_04.txt |
WA |
5 ms |
384 KB |