Submission #2012442


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
 
#define MOD (long long int)(1e9+7)
#define ll long long int

ll kaijo(int n){
	if(n==1){
		return 1;
	}
	return (n*kaijo(n-1))%MOD;
}

int main(void){
	int n;
	cin>>n;
	ll a[100001];
	ll b[100001];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=0;i<n;i++){
		cin>>b[i];
	}

	sort(a,a+n);
	sort(b,b+n);
	a[n]=9999999999;
	b[n]=9999999999;
	ll ans=1;
	int am=0,bm=0;
	while(am<n){
		
		if(a[am]>b[bm]){
			while(a[am]>b[bm]){
				bm++;
			}
			ans=(ans*kaijo(bm-am))%MOD;
			am=bm;
		}else{
			while(a[am]<b[bm]){
				am++;
			}
			ans=(ans*kaijo(am-bm))%MOD;
			bm=am;
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User Jirotech
Language C++14 (Clang 3.8.0)
Score 0
Code Size 762 Byte
Status WA
Exec Time 230 ms
Memory 3328 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 4
WA × 10
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt WA 141 ms 1408 KB
001.txt WA 51 ms 640 KB
002.txt WA 71 ms 768 KB
003.txt WA 79 ms 768 KB
004.txt WA 205 ms 1664 KB
005.txt WA 229 ms 1792 KB
006.txt WA 229 ms 1792 KB
007.txt WA 229 ms 1792 KB
008.txt WA 229 ms 1792 KB
009.txt WA 230 ms 1792 KB
010.txt AC 230 ms 3328 KB
011.txt AC 229 ms 1792 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB