oj.uz

Submission #3226

# Submission time Handle Problem Language Result Execution time Memory
3226 2013-08-29T08:32:29 Z pichulia 생일수 I (GA4_birthday1) C++
100 / 100
 96 ms 12804 KB 
#include<stdio.h>
int n;
int a[1000004][3];
bool is_smaller(int p[], int q[],int add)
{
	int s = p[0] + p[1] + p[2];
	int t = q[0] + q[1] + q[2];
	if(t < 0)return false;
	if(s < 0) return true;
	else if(s < t)return false;
	else if(s > t) return true;
	else
	{
		int ad[3];
		ad[0] = ad[1] = ad[2] = 0;
		ad[add] = 1;
		for(int i=0; i<3; i++)
		{
			if(p[i] < q[i]+ad[i])
				return false;
			else if(p[i] > q[i]+ad[i])
				return true;
		}
		return false;
	}
}
void print(int i)
{
	printf("%d : %d %d %d\n",i, a[i][0], a[i][1], a[i][2]);
}
int main()
{
	int t;
	int i, j, k;
	scanf("%d",&t);
	
		for(i=0; i<=1000000; i++)
			a[i][0] = a[i][1] = a[i][2] = -1;
		a[3][0] = 1;a[3][1] = 0;a[3][2] = 0;
		a[5][0] = 0;a[5][1] = 1;a[5][2] = 0;
		a[8][0] = 0;a[8][1] = 0;a[8][2] = 1;
		for(i=1; i<=1000000; i++)
		{
			if(i>=3)
			{
				if(is_smaller(a[i],a[i-3],0))
				{
					a[i][0] = a[i-3][0] + 1;
					a[i][1] = a[i-3][1];
					a[i][2] = a[i-3][2];
				}
			}
			if(i>=5)
			{
				if(is_smaller(a[i],a[i-5],1))
				{
					a[i][0] = a[i-5][0];
					a[i][1] = a[i-5][1]+1;
					a[i][2] = a[i-5][2];
				}
			}
			if(i>=8)
			{
				if(is_smaller(a[i],a[i-8],2))
				{
					a[i][0] = a[i-8][0];
					a[i][1] = a[i-8][1];
					a[i][2] = a[i-8][2]+1;
				}
			}
		}
	while(t--)
	{
		scanf("%d",&n);
		int p = a[n][0];
		int q = a[n][1];
		int r = a[n][2];
		if(p+q+r < 0)
			printf("-1\n");
		else
		{
			while(p--)printf("3");
			while(q--)printf("5");
			while(r--)printf("8");
			printf("\n");
		}
	}
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12804 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12804 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12804 KB Output is correct
2 Correct 12 ms 12804 KB Output is correct
3 Correct 20 ms 12804 KB Output is correct
4 Correct 20 ms 12804 KB Output is correct
5 Correct 12 ms 12804 KB Output is correct
6 Correct 16 ms 12804 KB Output is correct
7 Correct 20 ms 12804 KB Output is correct
8 Correct 12 ms 12804 KB Output is correct
9 Correct 16 ms 12804 KB Output is correct
10 Correct 16 ms 12804 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 12804 KB Output is correct
2 Correct 68 ms 12804 KB Output is correct
3 Correct 92 ms 12804 KB Output is correct
4 Correct 80 ms 12804 KB Output is correct
5 Correct 84 ms 12804 KB Output is correct
6 Correct 76 ms 12804 KB Output is correct
7 Correct 72 ms 12804 KB Output is correct
8 Correct 68 ms 12804 KB Output is correct
9 Correct 96 ms 12804 KB Output is correct
10 Correct 76 ms 12804 KB Output is correct
11 Correct 80 ms 12804 KB Output is correct
12 Correct 72 ms 12804 KB Output is correct
13 Correct 76 ms 12804 KB Output is correct
14 Correct 84 ms 12804 KB Output is correct
15 Correct 72 ms 12804 KB Output is correct
16 Correct 80 ms 12804 KB Output is correct
17 Correct 72 ms 12804 KB Output is correct
18 Correct 72 ms 12804 KB Output is correct
19 Correct 76 ms 12804 KB Output is correct
20 Correct 72 ms 12804 KB Output is correct
21 Correct 80 ms 12804 KB Output is correct
22 Correct 92 ms 12804 KB Output is correct
23 Correct 80 ms 12804 KB Output is correct
24 Correct 76 ms 12804 KB Output is correct
25 Correct 68 ms 12804 KB Output is correct