oj.uz

Submission #16840

# Submission time Handle Problem Language Result Execution time Memory
16840 2015-10-11T10:54:30 Z sinceww77 볼질 (OJUZ10_ballparade) C++
22 / 100
 8 ms 1276 KB 
#include <stdio.h>
int data[50010],c[5];
int main()
{
    int i,j,n,m,b=0,tot=0;
    scanf("%d\n",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d ",&m);
        if(m==1) b++;
        if(b==4)
        {
            if(c[3]==1)
            {
                c[3]=0;
                tot+=1;
            }
            if(c[2]==1)
            {
                c[2]=0;
                c[3]=1;
            }
            if(c[1]==1)
            {
                c[2]=1;
            }
            b=0;
        }
        if(m==2)
        {
            if(c[3]==1)
            {
                c[3]=0;
                tot+=1;
            }
            if(c[2]==1)
            {
                c[2]=0;
                c[3]=1;
            }
            if(c[1]==1)
            {
                c[2]=1;
            }
            c[1]=1;
            b=0;
        }
        if(m==3)
        {
            if(c[3]==1)
            {
                c[3]=0;
                tot+=1;
            }
            if(c[2]==1)
            {
                c[2]=0;
                c[3]=1;
            }
            if(c[1]==1)
            {
                c[1]=0;
                c[2]=1;
            }
            b=0;
        }
    }
    printf("%d",tot);
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
0.0 / 25.0

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

Subtask #3
0.0 / 53.0

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