Submission #4273907


Source Code Expand

#include <cstdio>


void sort(short *s, short *e, int n)
{
	short temp1, temp2;

	for (int i = 0; i < n; i++)
	{
		temp1 = i;
		for (int j = i; j < n; j++)
		{
			if (s[temp1] > s[j]) temp1 = j;
		}
		temp2 = s[i];
		s[i] = s[temp1];
		s[temp1] = temp2;

		temp2 = e[i];
		e[i] = e[temp1];
		e[temp1] = temp2;
	}
}

void print(short s, short e)
{
	short &t = s;

	for (short i = 0; i < 2; i++)
	{
		if (i == 1) t = e;

		if (t < 10) printf("000%d", t);
		else if (t < 100) printf("00%d", t);
		else if (t < 1000) printf("0%d", t);
		else printf("%d", t);

		if (i == 0) printf("-");
	}
	printf("\n");
}

int main()
{

	int n;

	static short s[30000], e[30000];

	short stemp = 2400, etemp = 0;

	scanf("%d", &n);

	for (int i = 0; i < n; i++)
	{
		scanf("%hd-%hd", &s[i], &e[i]);
		s[i] = s[i] - s[i] % 5;
		e[i] = e[i] + 4 - (e[i] + 4) % 5;
		if (e[i] % 100 == 60) e[i] += 40;
	}

	sort(s, e, n);

	//新しいのが可能かどうか
	bool flag = true;

	for (int i = 0; i < n; i++)
	{
		if (flag)
		{
			stemp = s[i];
			etemp = e[i];
			flag = false;
		}
		else
		{
			//時間が重なってたらエンドを書き換え
			if (s[i] <= etemp)
			{
				if(etemp < e[i]) etemp = e[i];
			}
			else
			{
				print(stemp, etemp);
				stemp = s[i];
				etemp = e[i];
			}
		}
	}
	print(stemp, etemp);

	return 0;

}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Humili
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1409 Byte
Status AC
Exec Time 422 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:56:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%hd-%hd", &s[i], &e[i]);
                                 ^

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 128 KB
00_sample_02.txt AC 1 ms 128 KB
00_sample_03.txt AC 1 ms 128 KB
cho_cho_chokudai.txt AC 406 ms 256 KB
chokudai_ga_cho.txt AC 422 ms 256 KB
test_01.txt AC 1 ms 128 KB
test_02.txt AC 1 ms 128 KB
test_03.txt AC 1 ms 128 KB
test_04.txt AC 1 ms 128 KB
test_05.txt AC 1 ms 128 KB
test_06.txt AC 1 ms 128 KB
test_07.txt AC 1 ms 128 KB
test_08.txt AC 1 ms 128 KB
test_09.txt AC 1 ms 128 KB
test_10.txt AC 1 ms 128 KB
test_11.txt AC 1 ms 128 KB
test_12.txt AC 1 ms 128 KB
test_13.txt AC 1 ms 128 KB
test_14.txt AC 1 ms 128 KB
test_15.txt AC 1 ms 128 KB
test_16.txt AC 1 ms 128 KB
test_17.txt AC 1 ms 128 KB
test_18.txt AC 1 ms 128 KB
test_19.txt AC 1 ms 128 KB
test_20.txt AC 1 ms 128 KB
test_21.txt AC 406 ms 256 KB
test_22.txt AC 406 ms 256 KB
test_23.txt AC 407 ms 256 KB
test_24.txt AC 406 ms 256 KB
test_25.txt AC 407 ms 256 KB
test_26.txt AC 406 ms 256 KB
test_27.txt AC 405 ms 256 KB
test_28.txt AC 406 ms 256 KB
test_29.txt AC 1 ms 128 KB
test_30.txt AC 1 ms 128 KB
test_31.txt AC 10 ms 128 KB
test_32.txt AC 1 ms 128 KB
test_33.txt AC 177 ms 256 KB
test_34.txt AC 1 ms 128 KB
test_35.txt AC 1 ms 128 KB
test_36.txt AC 406 ms 256 KB
test_37.txt AC 406 ms 256 KB
test_38.txt AC 406 ms 256 KB
test_39.txt AC 406 ms 256 KB
test_40.txt AC 406 ms 256 KB
test_41.txt AC 405 ms 256 KB
test_42.txt AC 406 ms 256 KB
test_43.txt AC 416 ms 256 KB