Submission #869584

Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<iostream>

typedef struct Hako
{
	long long int w,h,in;
} HAKO;

int sor(const void* a,const void *b)
{
	if((*(HAKO*)a).w < (*(HAKO*)b).w)
	{
		return -1;
	}
	if((*(HAKO*)a).w == (*(HAKO*)b).w)
	{
		if((*(HAKO*)a).h < (*(HAKO*)b).h)
		{
			return -1;
		}
		else if((*(HAKO*)a).h == (*(HAKO*)b).h)
		{
			return 0;
		}
		return 1;
	}
	return 1;
}

int sor2(const void* a,const void *b)
{
	return ((*(HAKO*)a).in - (*(HAKO*)b).in);
}


int main(void)
{
	long long int n,i,f,max;
	int flg=0;
	HAKO* hako;
	scanf("%lld",&n);
	hako=(HAKO*)calloc(n,sizeof(HAKO));
	for(i=0;i<n;i++)
	{
		scanf("%lld %lld",&hako[i].w,&hako[i].h);
		hako[i].in=0;
	}
	qsort(hako,n,sizeof(HAKO),sor);
/*
	for(i=0;i<n;i++)
	{
		printf("%lld %lld\n",hako[i].w,hako[i].h);
	}
*/
	max=0;
	for(i=1;i<n;i++)
	{
		if(hako[i].h>hako[max].h&&hako[i].w>hako[max].w)
		{
			hako[i].in = hako[max].in+1;
			max=i;
			flg=1;
		}
		for(f=i;f>=0&&flg!=1&&i-f<100;f--)
		{
			if(hako[i].h>hako[f].h&&hako[i].w>hako[f].w&&hako[i].in<=hako[f].in)
			{
				hako[i].in=hako[f].in+1;
				if(hako[max].in<hako[i].in)
				{
					max=i;
				}
			}
		}
		flg=0;
	}
	qsort(hako,n,sizeof(HAKO),sor2);
	printf("%lld\n",hako[n-1].in+1);
	return 0;
}

Submission Info

Submission Time
Task D - プレゼント
User misaka666
Language C++14 (Clang 3.8.0)
Score 30
Code Size 1322 Byte
Status WA
Exec Time 159 ms
Memory 4988 KiB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 4
AC × 19
AC × 18
WA × 12
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 4 ms 256 KiB
sample1.txt AC 4 ms 256 KiB
sample2.txt AC 4 ms 256 KiB
sample3.txt AC 4 ms 256 KiB
subtask0_0.txt AC 5 ms 256 KiB
subtask0_1.txt AC 4 ms 256 KiB
subtask0_10.txt AC 5 ms 256 KiB
subtask0_11.txt AC 5 ms 256 KiB
subtask0_12.txt AC 6 ms 256 KiB
subtask0_13.txt AC 6 ms 256 KiB
subtask0_14.txt AC 6 ms 256 KiB
subtask0_2.txt AC 5 ms 256 KiB
subtask0_3.txt AC 5 ms 256 KiB
subtask0_4.txt AC 5 ms 256 KiB
subtask0_5.txt AC 5 ms 256 KiB
subtask0_6.txt AC 5 ms 256 KiB
subtask0_7.txt AC 6 ms 256 KiB
subtask0_8.txt AC 5 ms 256 KiB
subtask0_9.txt AC 5 ms 256 KiB
subtask1_0.txt WA 96 ms 3172 KiB
subtask1_1.txt AC 7 ms 380 KiB
subtask1_10.txt AC 66 ms 3836 KiB
subtask1_11.txt AC 89 ms 4988 KiB
subtask1_12.txt WA 158 ms 4988 KiB
subtask1_13.txt WA 158 ms 4988 KiB
subtask1_14.txt WA 159 ms 4988 KiB
subtask1_2.txt WA 27 ms 1024 KiB
subtask1_3.txt WA 135 ms 4276 KiB
subtask1_4.txt WA 156 ms 4968 KiB
subtask1_5.txt WA 25 ms 936 KiB
subtask1_6.txt WA 117 ms 3764 KiB
subtask1_7.txt WA 64 ms 2172 KiB
subtask1_8.txt WA 136 ms 4348 KiB
subtask1_9.txt WA 69 ms 2300 KiB