Submission #895152


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int N = 100100;
int n, m, q;
int a[N];
int pos[N];
int len[N];
int cnt[N];
int b[N];

int main()
{
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);


	scanf("%d%d%d", &n, &m, &q);
	for (int i = 0; i < q; i++)
		scanf("%d", &a[i]);
	reverse(a, a + q);
	for (int i = 1; i <= m; i++)
		pos[i] = -1;
	for (int i = 0; i < q; i++)
	{
		int x = a[i];
		if (pos[x] == -1)
		{
			pos[x] = len[0];
			b[len[0]] = x;
			len[0]++;
			cnt[x] = 1;
		}
		else
		{
			int y = cnt[x];
			if (y >= n) continue;
			if (len[y] < pos[x]) continue;
			len[y]++;
			cnt[x]++;
		}
	}
	/*
	for (int i = 0; i < n; i++)
		printf("%d ", len[i]);
	printf("\n");
	for (int i = 0; i < len[0]; i++)
		printf("%d ", b[i]);
	printf("\n");
	*/
	int minUnused = m + 1;
	for (int x = 1; x <= m; x++)
		if (pos[x] == -1)
		{
			minUnused = x;
			break;
		}
	int L = len[0];
	while(L > 0 && b[L - 1] < minUnused)
	{
		L--;
		minUnused = b[L];
	}
	bool ok = 1;
	for (int i = 0; i < n; i++)
		ok &= len[i] >= L;
	if (ok)
		printf("Yes\n");
	else
		printf("No\n");

	return 0;
}

Submission Info

Submission Time
Task E - LRU Puzzle
User Um_nik
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 1244 Byte
Status AC
Exec Time 14 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &m, &q);
                             ^
./Main.cpp:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1200 / 1200
Status
AC × 4
AC × 76
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 3 ms 256 KB
0_03.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 12 ms 1408 KB
1_03.txt AC 12 ms 1408 KB
1_04.txt AC 11 ms 1408 KB
1_05.txt AC 11 ms 1408 KB
1_06.txt AC 14 ms 1792 KB
1_07.txt AC 14 ms 1792 KB
1_08.txt AC 14 ms 1792 KB
1_09.txt AC 14 ms 1792 KB
1_10.txt AC 13 ms 1280 KB
1_11.txt AC 13 ms 1280 KB
1_12.txt AC 13 ms 1280 KB
1_13.txt AC 13 ms 1280 KB
1_14.txt AC 13 ms 1280 KB
1_15.txt AC 13 ms 1280 KB
1_16.txt AC 13 ms 1280 KB
1_17.txt AC 13 ms 1280 KB
1_18.txt AC 14 ms 1664 KB
1_19.txt AC 13 ms 1280 KB
1_20.txt AC 14 ms 1664 KB
1_21.txt AC 14 ms 1792 KB
1_22.txt AC 14 ms 1664 KB
1_23.txt AC 14 ms 1408 KB
1_24.txt AC 14 ms 1792 KB
1_25.txt AC 14 ms 1408 KB
1_26.txt AC 11 ms 640 KB
1_27.txt AC 11 ms 640 KB
1_28.txt AC 12 ms 640 KB
1_29.txt AC 12 ms 640 KB
1_30.txt AC 12 ms 1152 KB
1_31.txt AC 12 ms 1152 KB
1_32.txt AC 12 ms 1024 KB
1_33.txt AC 13 ms 1280 KB
1_34.txt AC 13 ms 1024 KB
1_35.txt AC 13 ms 1152 KB
1_36.txt AC 13 ms 896 KB
1_37.txt AC 13 ms 1152 KB
1_38.txt AC 14 ms 1408 KB
1_39.txt AC 14 ms 1536 KB
1_40.txt AC 14 ms 1664 KB
1_41.txt AC 14 ms 1792 KB
1_42.txt AC 11 ms 640 KB
1_43.txt AC 11 ms 640 KB
1_44.txt AC 12 ms 640 KB
1_45.txt AC 11 ms 640 KB
1_46.txt AC 12 ms 768 KB
1_47.txt AC 12 ms 896 KB
1_48.txt AC 12 ms 896 KB
1_49.txt AC 13 ms 1280 KB
1_50.txt AC 11 ms 640 KB
1_51.txt AC 11 ms 640 KB
1_52.txt AC 12 ms 768 KB
1_53.txt AC 12 ms 640 KB
1_54.txt AC 12 ms 1024 KB
1_55.txt AC 11 ms 896 KB
1_56.txt AC 13 ms 1152 KB
1_57.txt AC 13 ms 1280 KB
1_58.txt AC 11 ms 640 KB
1_59.txt AC 11 ms 640 KB
1_60.txt AC 11 ms 640 KB
1_61.txt AC 11 ms 640 KB
1_62.txt AC 11 ms 896 KB
1_63.txt AC 11 ms 1024 KB
1_64.txt AC 11 ms 768 KB
1_65.txt AC 13 ms 1152 KB
1_66.txt AC 11 ms 896 KB
1_67.txt AC 11 ms 896 KB
1_68.txt AC 11 ms 768 KB
1_69.txt AC 11 ms 896 KB
1_70.txt AC 11 ms 1152 KB
1_71.txt AC 13 ms 1152 KB