Submission #3781947


Source Code Expand

char str[8] = "IJPC*";

int max(int a, int b) { if (a>b) { return a; }return b; }
int min(int a, int b) { if (a<b) { return a; }return b; }

int replace(int N, char S[]) {
	int i,j,w,r=4,k;
	char ts[8]={0};
	for(i=0;i<15;i++){
		w=i;
		k=0;
		for(j=0;j<4;j++){
			if(w%2==1){
				ts[j]='#';
				k++;
			}
			else{
				ts[j]=str[j];
			}
			w/=2;
		}
		w=0;
		for(j=0;j<N;j++){
          //printf("%s %d:%d\n",ts,j,w);
			if(ts[w]=='#'){w++;}
			else if(ts[w]==S[j]){w++;}
			if(w==4){break;}
		}
		if(w==4){
			r=min(r,k);
		}
	}
    return r;
}

Submission Info

Submission Time
Task A - 国際情報オリンピック日本代表プログラミングコンテスト (Welcome to IJPC)
User physics0523
Language IOI-Style C++ (GCC 5.4.1)
Score 100
Code Size 580 Byte
Status AC
Exec Time 6 ms
Memory 256 KB

Compile Error

./grader.cpp: In function ‘int main()’:
./grader.cpp:10:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%s", &N, S);
                       ^

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 50 / 50 50 / 50
Status
AC × 14
AC × 13
Set Name Test Cases
Subtask1 subtask1/1, subtask1/10, subtask1/11, subtask1/12, subtask1/13, subtask1/14, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9
Subtask2 subtask2/1, subtask2/10, subtask2/11, subtask2/12, subtask2/13, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9
Case Name Status Exec Time Memory
subtask1/1 AC 1 ms 128 KB
subtask1/10 AC 1 ms 128 KB
subtask1/11 AC 1 ms 128 KB
subtask1/12 AC 1 ms 128 KB
subtask1/13 AC 1 ms 128 KB
subtask1/14 AC 1 ms 128 KB
subtask1/2 AC 0 ms 128 KB
subtask1/3 AC 1 ms 128 KB
subtask1/4 AC 1 ms 128 KB
subtask1/5 AC 1 ms 128 KB
subtask1/6 AC 1 ms 128 KB
subtask1/7 AC 1 ms 128 KB
subtask1/8 AC 1 ms 128 KB
subtask1/9 AC 0 ms 128 KB
subtask2/1 AC 1 ms 128 KB
subtask2/10 AC 4 ms 256 KB
subtask2/11 AC 6 ms 256 KB
subtask2/12 AC 4 ms 256 KB
subtask2/13 AC 5 ms 256 KB
subtask2/2 AC 1 ms 128 KB
subtask2/3 AC 1 ms 128 KB
subtask2/4 AC 1 ms 128 KB
subtask2/5 AC 1 ms 128 KB
subtask2/6 AC 5 ms 256 KB
subtask2/7 AC 6 ms 256 KB
subtask2/8 AC 5 ms 256 KB
subtask2/9 AC 6 ms 256 KB