Submission #896648


Source Code Expand

#include<cstdio>

using namespace std;

int N, M;
int a[100100];
int Q;

int ids[100100];
int cnts[100100];
int num;
int rev_ids[100100];

void init(){
	for(int i = 0; i < N; ++i){
		ids[i] = -1;
		cnts[i] = 0;
	}
	num = 0;
}

bool used[100100];

void restore(int *a, int L, int N){
	for(int i = 0; i < N; ++i) used[i] = false;
	for(int i = 0; i < L; ++i) used[a[i]] = true;
	int c = L;
	for(int i = 0; i < N; ++i){
		if(!used[i]) a[c++] = i;
	}
}

int fi[100100];
int la[100100];

bool solve(){
	init();
	for(int i = Q - 1; i >= 0; --i){
		int x = a[i];
		if(ids[x] == -1){
			ids[x] = num++;
			rev_ids[ids[x]] = x;
		}
		int id = ids[x];
		//printf("%d\n", id);
		if(id > 0 && cnts[id - 1] == cnts[id]){
			//nothing
		} else {
			if(cnts[id] < M){
				cnts[id]++;
			}
		}
	}
	bool flg = true;
	for(int i = 0; i < N; ++i){
		if(cnts[i] != 0 && cnts[i] != M){
			flg = false;
			break;
		}
	}
	if(flg) return true;
	/*for(int i = 0; i < N; ++i){
		printf("%d %d\n", rev_ids[i], cnts[i]);
	}
	printf("\n");*/
	int l1 = 0, l2 = 0;
	for(int i = 0; i < N; ++i){
		if(cnts[i] > 0){
			fi[i] = rev_ids[i];
			l1++;
		}
		
		if(cnts[i] == M){
			la[i] = rev_ids[i];
			l2++;
		}
	}
	restore(fi, l1, N);
	restore(la, l2, N);
	/*for(int i = 0; i < N; ++i){
		printf("%d %d\n", fi[i], la[i]);
	}*/
	for(int i = 0; i < N; ++i){
		if(fi[i] != la[i]) return false;
	}
	return true;
}

void input(){
	scanf("%d%d", &M, &N);
	scanf("%d", &Q);
	for(int i = 0; i < Q; ++i){
		scanf("%d", a + i);
		a[i]--;
	}
}

int main(){
	input();
	bool flg = solve();
	if(flg) printf("Yes\n");
	else printf("No\n");
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘void input()’:
./Main.cpp:90:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &M, &N);
                       ^
./Main.cpp:91:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
                 ^
./Main.cpp:93: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 1 ms 128 KB
0_01.txt AC 1 ms 128 KB
0_02.txt AC 1 ms 128 KB
0_03.txt AC 1 ms 128 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 1 ms 128 KB
1_02.txt AC 10 ms 1280 KB
1_03.txt AC 10 ms 1280 KB
1_04.txt AC 11 ms 2176 KB
1_05.txt AC 11 ms 2176 KB
1_06.txt AC 14 ms 2560 KB
1_07.txt AC 14 ms 2560 KB
1_08.txt AC 14 ms 2560 KB
1_09.txt AC 14 ms 2560 KB
1_10.txt AC 12 ms 1152 KB
1_11.txt AC 12 ms 1536 KB
1_12.txt AC 12 ms 1536 KB
1_13.txt AC 12 ms 1536 KB
1_14.txt AC 12 ms 1152 KB
1_15.txt AC 12 ms 1536 KB
1_16.txt AC 12 ms 1536 KB
1_17.txt AC 12 ms 1664 KB
1_18.txt AC 14 ms 2304 KB
1_19.txt AC 13 ms 1664 KB
1_20.txt AC 14 ms 2304 KB
1_21.txt AC 14 ms 2560 KB
1_22.txt AC 14 ms 2432 KB
1_23.txt AC 14 ms 2048 KB
1_24.txt AC 14 ms 2560 KB
1_25.txt AC 14 ms 1920 KB
1_26.txt AC 10 ms 640 KB
1_27.txt AC 9 ms 640 KB
1_28.txt AC 11 ms 640 KB
1_29.txt AC 11 ms 640 KB
1_30.txt AC 12 ms 1792 KB
1_31.txt AC 12 ms 1792 KB
1_32.txt AC 11 ms 1536 KB
1_33.txt AC 13 ms 1792 KB
1_34.txt AC 12 ms 1152 KB
1_35.txt AC 13 ms 1536 KB
1_36.txt AC 12 ms 1024 KB
1_37.txt AC 13 ms 1408 KB
1_38.txt AC 14 ms 2048 KB
1_39.txt AC 14 ms 2176 KB
1_40.txt AC 14 ms 2432 KB
1_41.txt AC 14 ms 2560 KB
1_42.txt AC 10 ms 640 KB
1_43.txt AC 10 ms 640 KB
1_44.txt AC 10 ms 640 KB
1_45.txt AC 10 ms 640 KB
1_46.txt AC 11 ms 896 KB
1_47.txt AC 11 ms 1152 KB
1_48.txt AC 11 ms 1152 KB
1_49.txt AC 13 ms 2048 KB
1_50.txt AC 10 ms 640 KB
1_51.txt AC 10 ms 640 KB
1_52.txt AC 11 ms 768 KB
1_53.txt AC 11 ms 640 KB
1_54.txt AC 12 ms 1920 KB
1_55.txt AC 11 ms 1152 KB
1_56.txt AC 13 ms 2304 KB
1_57.txt AC 13 ms 2048 KB
1_58.txt AC 9 ms 512 KB
1_59.txt AC 9 ms 640 KB
1_60.txt AC 9 ms 640 KB
1_61.txt AC 9 ms 640 KB
1_62.txt AC 10 ms 1152 KB
1_63.txt AC 11 ms 2176 KB
1_64.txt AC 10 ms 1024 KB
1_65.txt AC 13 ms 1920 KB
1_66.txt AC 9 ms 640 KB
1_67.txt AC 10 ms 640 KB
1_68.txt AC 10 ms 640 KB
1_69.txt AC 10 ms 640 KB
1_70.txt AC 11 ms 2176 KB
1_71.txt AC 13 ms 1792 KB