Submission #329907

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define rep2(x,from,to) for(long long x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 10000000
long long na;
long long nb;
long long a[100000];
long long b[100000];
long long z;
int main()
{
	cin>>na>>nb;
	rep(i,na)cin>>a[i];
	rep(i,nb)cin>>b[i];
	long long aa=0;
	long long bb=0;
	sort(a,a+na);
	sort(b,b+nb);
	while(1)
	{
		if(aa==na||bb==nb)break;
		if(a[aa]>b[bb])bb++;
		else if(a[aa]<b[bb])aa++;
		else
		{
			z++;
			aa++;
			bb++;
		}
	}
	cout<<(double)z/(double)(na+nb-z)<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - メタ構文変数
User tainohimono
Language C++ (G++ 4.6.4)
Score 100
Code Size 686 Byte
Status AC
Exec Time 191 ms
Memory 2348 KiB

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 × 26
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 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 25 ms 912 KiB
sample_02.txt AC 25 ms 924 KiB
subtask1_01.txt AC 25 ms 796 KiB
subtask1_02.txt AC 24 ms 796 KiB
subtask1_03.txt AC 24 ms 928 KiB
subtask1_04.txt AC 25 ms 800 KiB
subtask1_05.txt AC 27 ms 732 KiB
subtask1_06.txt AC 26 ms 748 KiB
subtask1_07.txt AC 25 ms 932 KiB
subtask1_08.txt AC 24 ms 804 KiB
subtask1_09.txt AC 26 ms 800 KiB
subtask1_10.txt AC 27 ms 764 KiB
subtask2_01.txt AC 71 ms 1436 KiB
subtask2_02.txt AC 146 ms 2280 KiB
subtask2_03.txt AC 73 ms 1432 KiB
subtask2_04.txt AC 144 ms 2344 KiB
subtask2_05.txt AC 52 ms 1052 KiB
subtask2_06.txt AC 85 ms 1576 KiB
subtask2_07.txt AC 118 ms 1960 KiB
subtask2_08.txt AC 144 ms 2336 KiB
subtask3_01.txt AC 125 ms 1704 KiB
subtask3_02.txt AC 188 ms 2348 KiB
subtask3_03.txt AC 69 ms 1180 KiB
subtask3_04.txt AC 188 ms 2344 KiB
subtask3_05.txt AC 117 ms 1568 KiB
subtask3_06.txt AC 189 ms 2340 KiB
subtask3_07.txt AC 139 ms 1812 KiB
subtask3_08.txt AC 191 ms 2236 KiB