Submission #1293734


Source Code Expand

#include<stdio.h>
int lb(int l,int r,int n,int *d){
  int m=(l+r)/2;
  if(l==r)return m;
  return n<=d[m]?lb(l,m,n,d):lb(m+1,r,n,d);
}
int R=1,C=1,H[2000010],N[2000010];
//評価関数(いまはMAX)
int hyouka(int a,int b){
  if(C<b)return 1;
  if(C<a||b==0)return 0;
  return N[H[a]]<N[H[b]]?1:0;
}
//挿入関数
void hin(int a){
  int i=C++;
  for(N[H[0]=R]=a;hyouka(0,i/2);i/=2)H[i]=H[i/2];
  H[i]=R++;
}
//取り出す関数
int hout(){
  int rt=H[1],i,j=2,k=H[--C];
  for(i=1;hyouka(i,C);i=j)H[i]=H[j=i*2+1-hyouka(i*2,i*2+1)];
  H[j/2]=k;
  return rt;
}
int main(){
	int n,m,i,a,s=0,d[100010];
	scanf("%d %d",&n,&m);
	for(i=0;i<n;i++){
		scanf("%d",&a);
		hin(a);
	}
	for(i=0;i<n;i++)d[i]=N[hout()];
	for(i=0;i<m;i++){
		scanf("%d",&a);
		if(d[lb(0,n-1,a,d)]==a)s++;
	}
	printf("%f\n",1.0*s/(n+m-s));
	return 0;
}

Submission Info

Submission Time
Task B - メタ構文変数
User yuiop
Language C (GCC 5.4.1)
Score 100
Code Size 863 Byte
Status AC
Exec Time 59 ms
Memory 4992 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:29:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ^
./Main.c:31:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a);
   ^
./Main.c:36:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a);
   ^

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 40 / 40 30 / 30 30 / 30
Status
AC × 2
AC × 11
AC × 19
AC × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt
Subtask2 sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt
Subtask3 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 2176 KB
sample_02.txt AC 1 ms 2176 KB
subtask1_01.txt AC 1 ms 2176 KB
subtask1_02.txt AC 1 ms 2176 KB
subtask1_03.txt AC 1 ms 2176 KB
subtask1_04.txt AC 1 ms 2176 KB
subtask1_05.txt AC 1 ms 2176 KB
subtask1_06.txt AC 1 ms 2176 KB
subtask1_07.txt AC 1 ms 2176 KB
subtask1_08.txt AC 1 ms 2176 KB
subtask1_09.txt AC 1 ms 2176 KB
subtask1_10.txt AC 1 ms 2176 KB
subtask2_01.txt AC 18 ms 2432 KB
subtask2_02.txt AC 54 ms 4992 KB
subtask2_03.txt AC 20 ms 2560 KB
subtask2_04.txt AC 54 ms 4992 KB
subtask2_05.txt AC 11 ms 2432 KB
subtask2_06.txt AC 24 ms 2560 KB
subtask2_07.txt AC 42 ms 2816 KB
subtask2_08.txt AC 54 ms 4992 KB
subtask3_01.txt AC 34 ms 2688 KB
subtask3_02.txt AC 58 ms 4992 KB
subtask3_03.txt AC 14 ms 2432 KB
subtask3_04.txt AC 58 ms 4992 KB
subtask3_05.txt AC 36 ms 2944 KB
subtask3_06.txt AC 59 ms 4992 KB
subtask3_07.txt AC 44 ms 4992 KB
subtask3_08.txt AC 59 ms 4992 KB