Submission #41789816


Source Code Expand

#include <stdio.h>

void merge_sort(int n, int x[])
{
	static int y[200001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int main()
{
	int i, N, A[200001];
	scanf("%d", &N);
	for (i = 0; i < N; i++) scanf("%d", &(A[i]));
	merge_sort(N, A);
	
	int num = 0;
	if (N >= 3) for (i = 0; i < N; i++) if (A[i] == A[(N+1)/2]) num++;
	if (num * 2 > N) printf("No\n");
	else printf("Yes\n");
	fflush(stdout);
	return 0;
}

Submission Info

Submission Time
Task A - Make M
User ygussany
Language C (GCC 9.2.1)
Score 300
Code Size 706 Byte
Status AC
Exec Time 59 ms
Memory 3224 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:22:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   22 |  scanf("%d", &N);
      |  ^~~~~~~~~~~~~~~
./Main.c:23:26: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   23 |  for (i = 0; i < N; i++) scanf("%d", &(A[i]));
      |                          ^~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 31
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt
All 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt, 01-028.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 6 ms 1516 KiB
00-sample-002.txt AC 1 ms 1512 KiB
00-sample-003.txt AC 1 ms 1664 KiB
01-001.txt AC 1 ms 1600 KiB
01-002.txt AC 1 ms 1592 KiB
01-003.txt AC 1 ms 1600 KiB
01-004.txt AC 33 ms 3144 KiB
01-005.txt AC 34 ms 3172 KiB
01-006.txt AC 44 ms 3172 KiB
01-007.txt AC 35 ms 3068 KiB
01-008.txt AC 46 ms 3176 KiB
01-009.txt AC 59 ms 3072 KiB
01-010.txt AC 55 ms 3220 KiB
01-011.txt AC 1 ms 1600 KiB
01-012.txt AC 1 ms 1524 KiB
01-013.txt AC 4 ms 1652 KiB
01-014.txt AC 1 ms 1572 KiB
01-015.txt AC 1 ms 1524 KiB
01-016.txt AC 1 ms 1592 KiB
01-017.txt AC 36 ms 3128 KiB
01-018.txt AC 35 ms 3072 KiB
01-019.txt AC 37 ms 3076 KiB
01-020.txt AC 37 ms 3176 KiB
01-021.txt AC 38 ms 3224 KiB
01-022.txt AC 37 ms 3220 KiB
01-023.txt AC 40 ms 3172 KiB
01-024.txt AC 36 ms 3164 KiB
01-025.txt AC 35 ms 3128 KiB
01-026.txt AC 38 ms 3180 KiB
01-027.txt AC 37 ms 3064 KiB
01-028.txt AC 37 ms 3152 KiB