oj.uz

Submission #14042

# Submission time Handle Problem Language Result Execution time Memory
14042 2015-04-25T15:09:33 Z paulsohn 볼질 (OJUZ10_ballparade) C++
75 / 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];
    if(prev[3]){
        if(prev[2]){
            if(prev[1]){
                ++score;
                run[3]=run[2]=run[1]=run[0]=true;
            }
            else run[1]=true;
        }
        else run[2]=true;
    }
    else{
        if(prev[2] && prev[1]) run[3]=true;
        else if(prev[1]) run[2]=true;
        else run[1]=true;
    }
}

int main()
{
    int i,th;
    scanf("%d",&n);
    run[0]=true;
    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];
            run[1]=false;
            if(cnt==4){
                cnt=0;
                run[1]=run[0];
                run[0]=true;
            }
            break;
        }
        /*
        printf("%d : ",th);
        for(int j=0;j<4;++j){

            if(run[j]) printf("%d ",j);
            else printf("  ");
        }
        printf("\n");
        */
    }
    printf("%d",score);

    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
0.0 / 25.0

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

Subtask #3
53.0 / 53.0

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