Submission #14175

# Submission time Handle Problem Language Result Execution time Memory
14175 2015-05-03T05:50:29 Z heohyun0703 볼질 (OJUZ10_ballparade) C++
0 / 100
7 ms 1084 KB
#include <stdio.h>
int n;
int base[4]={0,};
int ball_num;
int ans=0;
int main()
{
    int a,i;
    scanf("%d",&n);
    ball_num = 0;
    for(i=1; i<=n; i++){
        scanf("%d",&a);
        if(a == 1){
            ball_num++;
        }
        else if(a == 3){
            ball_num++;
            if(base[3] == 1){
                base[3] = 0;
                ans++;
            }
            if(base[2] == 1){
                base[2] = 0;
                base[3] = 1;
            }
            if(base[1] == 1){
                base[1] = 0;
                base[2] = 1;
            }
        }
        if(ball_num == 4 || a == 2){
            ball_num = 0;
            if(base[2] == 1 && base[1] == 1){
                base[3] = 0;
                ans++;
            }
            if(base[1] == 1){
                base[2] = 0;
                base[3] = 1;
            }
            if(base[1] == 1){
                base[1] = 0;
                base[2] = 1;
            }
            base[1] = 1;
        }
    }
    printf("%d\n",ans);
    return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Correct 0 ms 1084 KB Output is correct
3 Incorrect 0 ms 1084 KB Output isn't correct
4 Incorrect 4 ms 1084 KB Output isn't correct
5 Incorrect 0 ms 1084 KB Output isn't correct
6 Incorrect 4 ms 1084 KB Output isn't correct
7 Incorrect 0 ms 1084 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1084 KB Output isn't correct
2 Incorrect 0 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 Correct 0 ms 1084 KB Output is correct
8 Incorrect 0 ms 1084 KB Output isn't correct
# 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 4 ms 1084 KB Output isn't correct
4 Incorrect 7 ms 1084 KB Output isn't correct
5 Incorrect 0 ms 1084 KB Output isn't correct
6 Incorrect 6 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
9 Incorrect 0 ms 1084 KB Output isn't correct
10 Incorrect 0 ms 1084 KB Output isn't correct
11 Incorrect 7 ms 1084 KB Output isn't correct
12 Incorrect 3 ms 1084 KB Output isn't correct
13 Incorrect 0 ms 1084 KB Output isn't correct
14 Incorrect 6 ms 1084 KB Output isn't correct
15 Incorrect 5 ms 1084 KB Output isn't correct