oj.uz

Submission #14109

# Submission time Handle Problem Language Result Execution time Memory
14109 2015-05-02T05:50:54 Z jackae98 볼질 (OJUZ10_ballparade) C++
0 / 100
 6 ms 1276 KB 
#include <stdio.h>
int n;
int a[50010];
int b[5];
int ball;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	for(int i=1;i<=n;i++){
		if(a[i]==1)
		{
			ball++;
			if(ball==4)
			{
				ball=0;
				b[0]++;
				for(int j=3;j>=0;j--){
					if(b[j]==0||b[j]==1&&b[j-1]==1)
					{
						b[j+1]++;
						b[j]--;
					}
				}
			}
		}
		if(a[i]==2)
		{
			ball=0;
			b[0]++;
			for(int j=3;j>=0;j--){
				if(b[j]==0||b[j]>=1&&b[j-1]==1)
				{
					b[j+1]++;
					b[j]--;
				}
			}
		}
		if(a[i]==3)
		{
			ball++;
			if(ball==4)
			{
				ball=0;
				b[0]++;
			}
			for(int j=3;j>=0;j--){
				if(b[j]>=1)
				{
					b[j+1]++;
					b[j]--;
				}
			}
		}
	}
	printf("%d",b[4]);
}

Subtask #1
0.0 / 22.0

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

Subtask #2
0.0 / 25.0

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

Subtask #3
0.0 / 53.0

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