Submission #1000578


Source Code Expand

#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
typedef long long LL;

int main(){
	int n;
	cin >> n;
	pair<int,int> s[2*n];
	for(int i = 0; i < n; i++){
		cin >> s[i].first;
		s[i].second = -1;
	}
	for(int i = 0; i < n; i++){
		cin >> s[i+n].first;
		s[i+n].second = 1;
	}
	sort(s,s+2*n);
	LL ans = 1;
	LL cur = 0;
	for(int i = 0; i < 2*n; i++){
		if(abs(cur+s[i].second) < abs(cur)){
			ans *= abs(cur);
			ans %= MOD;
		}
		cur += s[i].second;
	}
	cout << ans << endl;


}

Submission Info

Submission Time
Task A - 1D Matching
User ksun48
Language C++14 (GCC 5.4.1)
Score 500
Code Size 528 Byte
Status AC
Exec Time 107 ms
Memory 1920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 14
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 AC 65 ms 1152 KB
001.txt AC 25 ms 512 KB
002.txt AC 34 ms 768 KB
003.txt AC 38 ms 768 KB
004.txt AC 95 ms 1664 KB
005.txt AC 107 ms 1792 KB
006.txt AC 107 ms 1792 KB
007.txt AC 107 ms 1792 KB
008.txt AC 107 ms 1792 KB
009.txt AC 107 ms 1792 KB
010.txt AC 106 ms 1792 KB
011.txt AC 106 ms 1920 KB
example0.txt AC 2 ms 256 KB
example1.txt AC 2 ms 256 KB