oj.uz

Submission #14036

# Submission time Handle Problem Language Result Execution time Memory
14036 2015-04-25T14:47:07 Z paulsohn 볼질 (OJUZ10_ballparade) C++
0 / 100
 7 ms 1084 KB 
#include <cstdio>
#include <algorithm>
using namespace std;

bool run[4], prev[4];
int n, score, cnt;

void mov(){
    cnt=0;
    for(int j=0;j<4;++j) prev[j]=run[j];
    run[0]=true;
    run[1]=prev[0];
    run[2]=prev[1];
    run[3]=prev[2]&&prev[1];
    if(prev[3]&&run[3]) ++score;
}

int main()
{
    int i,th;
    scanf("%d",&n);
    for(i=0;i<n;++i){
        scanf("%d",&th);
        switch(th){
        case 1:
            if(++cnt==4) mov();
            break;
        case 2:
            mov();
            break;
        case 3:
            ++cnt;
            if(run[3]) ++score;
            run[3]=run[2];
            run[2]=run[1];
            if(cnt==4){
                cnt=0;
                run[1]=run[0];
                run[0]=true;
            }
            break;
        }
    }
    printf("%d",score);

    return 0;
}

Subtask #1
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Incorrect 4 ms 1084 KB Output isn't correct
3 Incorrect 0 ms 1084 KB Output isn't correct
4 Incorrect 0 ms 1084 KB Output isn't correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Incorrect 2 ms 1084 KB Output isn't correct

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Incorrect 6 ms 1084 KB Output isn't correct
3 Correct 0 ms 1084 KB Output is correct
4 Incorrect 7 ms 1084 KB Output isn't correct
5 Incorrect 3 ms 1084 KB Output isn't correct
6 Incorrect 0 ms 1084 KB Output isn't correct
7 Incorrect 0 ms 1084 KB Output isn't correct
8 Incorrect 0 ms 1084 KB Output isn't correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Incorrect 6 ms 1084 KB Output isn't correct
3 Incorrect 0 ms 1084 KB Output isn't correct
4 Incorrect 0 ms 1084 KB Output isn't correct
5 Incorrect 3 ms 1084 KB Output isn't correct
6 Incorrect 3 ms 1084 KB Output isn't correct
7 Incorrect 0 ms 1084 KB Output isn't correct
8 Incorrect 3 ms 1084 KB Output isn't correct
9 Incorrect 0 ms 1084 KB Output isn't correct
10 Incorrect 6 ms 1084 KB Output isn't correct
11 Incorrect 6 ms 1084 KB Output isn't correct
12 Incorrect 3 ms 1084 KB Output isn't correct
13 Incorrect 7 ms 1084 KB Output isn't correct
14 Incorrect 6 ms 1084 KB Output isn't correct
15 Incorrect 6 ms 1084 KB Output isn't correct