Submission #1244090

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <time.h>
#include <sys/timeb.h>
 
using namespace std;
 
int get_time(string r)
{
	struct timeb rawtime;
	ftime(&rawtime);
	static int ms = rawtime.millitm;
	static unsigned long s = rawtime.time;
	int out_ms = rawtime.millitm - ms;
	unsigned long out_s = rawtime.time - s;
	if (out_ms < 0)
	{
		out_ms += 1000;
		out_s -= 1;
	}
	ms = rawtime.millitm;
	s = rawtime.time;
	int total = 1000*out_s+out_ms;
	cout<<r<<": "<<total<<"ms"<<endl;
	return total;
}
 
bool cmp(pair<int, int> a, pair<int, int> b) {
	return a.first < b.first;
}
 
int main(int argc, char *argv[]) {
//	get_time("begin");
	
	long beMod = 1000000007;
	int N;
	int a, b;
	vector<pair<int, int>> all;
	cin >> N;
	for (int i = 0; i < N; i++)
		cin>>a, all.emplace_back(a, 1);
	for (int i = 0; i < N; i++)
		cin>>b, all.emplace_back(b, -1);
		
	sort(all.begin(), all.end(), cmp);
	
	vector<long> f(10001); //factorial
	f[0] = 1;
	for (int i = 1; i <= 10000; i++)
		f[i] = (f[i - 1] * i) % beMod;
		
//	for (int i = 0; i < 2 * N; i++) cout<<all[i].first<<endl;
	
	long curr = -1, sum = 0, res = 1;
	for (int i = 0; i < 2 * N; i++) {
		sum += all[i].second;
		if (sum == 0) {
			res = (res * f[(i - curr) / 2]) % beMod;
			curr = i;
		}
	}
	
	cout<<res<<endl;
	
//	get_time("end");
	return 0;
} 

Submission Info

Judge Result