CSES - E4590 2016 1 - Results
Submission details
Task:Coffee shops
Sender:eax511
Submission time:2016-09-17 13:50:30 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1UNKNOWN--details
#2UNKNOWN--details
#3UNKNOWN--details
#4UNKNOWN--details
#5UNKNOWN--details
#6UNKNOWN--details
#7UNKNOWN--details
#8UNKNOWN--details
#9UNKNOWN--details
#10UNKNOWN--details
#11UNKNOWN--details
#12UNKNOWN--details
#13UNKNOWN--details
#14UNKNOWN--details
#15UNKNOWN--details
#16UNKNOWN--details
#17UNKNOWN--details
#18UNKNOWN--details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:4:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
input/code.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&c);
     ~~~~~^~~~~~~~~

Code

#include <stdio.h>
int main(){
  int n,i,c,a[3],b[3];
  scanf("%d",&n);
  a[1]=b[1]=0;
  a[2]=b[2]=1e9;
  a[0]=b[0]=1e9;
  for(i=0;i<n;++i){
    scanf("%d",&c);
    b[0]=a[0];
    b[1]=a[1];
    b[2]=a[2];
    a[0]=b[0]+c;
    if(a[0]>(b[1]+c))a[0]=b[1]+c;
    if(a[0]>(b[2]+c))a[0]=b[2]+c;
    a[1]=b[0];
    a[2]=b[1];
  }
  if(a[0]>a[1])a[0]=a[1];
  printf("%d\n",a[0]);
  return 0;
}

Test details

Test 1

Verdict: UNKNOWN

input
9
1 1 1000 1 1000 1000 1 1 1

correct output
4

user output
(not available)

Test 2

Verdict: UNKNOWN

input
100
5 6 3 10 10 1 8 3 8 4 3 1 10 4...

correct output
152

user output
(not available)

Test 3

Verdict: UNKNOWN

input
1000
4 5 5 7 3 4 9 5 1 5 9 9 1 9 2 ...

correct output
1383

user output
(not available)

Test 4

Verdict: UNKNOWN

input
10000
10 8 9 6 3 5 2 9 4 7 6 3 1 1 2...

correct output
13686

user output
(not available)

Test 5

Verdict: UNKNOWN

input
100000
9 7 6 1 9 9 9 4 7 9 6 5 9 1 8 ...

correct output
136447

user output
(not available)

Test 6

Verdict: UNKNOWN

input
1000000
2 7 4 4 5 6 5 9 5 9 1 6 8 3 5 ...

correct output
1355562

user output
(not available)

Test 7

Verdict: UNKNOWN

input
1000000
4 8 3 6 4 5 4 9 3 6 8 7 8 1 5 ...

correct output
1358066

user output
(not available)

Test 8

Verdict: UNKNOWN

input
1000000
4 5 5 9 3 2 2 8 5 9 6 4 6 7 10...

correct output
1356381

user output
(not available)

Test 9

Verdict: UNKNOWN

input
1000000
6 3 1 2 8 5 5 4 7 6 7 10 10 1 ...

correct output
1357998

user output
(not available)

Test 10

Verdict: UNKNOWN

input
1000000
5 5 4 6 10 8 10 5 7 9 7 7 6 4 ...

correct output
1358217

user output
(not available)

Test 11

Verdict: UNKNOWN

input
1
42

correct output
42

user output
(not available)

Test 12

Verdict: UNKNOWN

input
2
58 105

correct output
58

user output
(not available)

Test 13

Verdict: UNKNOWN

input
2
5 3

correct output
3

user output
(not available)

Test 14

Verdict: UNKNOWN

input
1000000
1000 1000 1000 1000 1000 1000 ...

correct output
333334000

user output
(not available)

Test 15

Verdict: UNKNOWN

input
1000000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
333334

user output
(not available)

Test 16

Verdict: UNKNOWN

input
1
1

correct output
1

user output
(not available)

Test 17

Verdict: UNKNOWN

input
3
5 7 4

correct output
7

user output
(not available)

Test 18

Verdict: UNKNOWN

input
6
2 7 1 7 7 4

correct output
7

user output
(not available)