Submission #1000889
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
using pii=pair<int,int>;
vector<pii> ary;
const ll mod=1000000007LL;
int main(void){
int n;
cin >> n;
rep(i,n){
int in;
cin >> in;
ary.emplace_back(pii(in,1));
}
rep(i,n){
int in;
cin >> in;
ary.emplace_back(pii(in,-1));
}
sort(_all(ary));
ll ans=1LL,cnt=0LL;
for(auto &it:ary){
if(abs(cnt)>abs(cnt+it.second)) ans*=abs(cnt),ans%=mod;
cnt+=it.second;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 1D Matching |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1651 Byte |
Status |
AC |
Exec Time |
110 ms |
Memory |
2420 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
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 |
67 ms |
1400 KB |
001.txt |
AC |
26 ms |
892 KB |
002.txt |
AC |
35 ms |
892 KB |
003.txt |
AC |
40 ms |
1400 KB |
004.txt |
AC |
99 ms |
2420 KB |
005.txt |
AC |
110 ms |
2420 KB |
006.txt |
AC |
110 ms |
2420 KB |
007.txt |
AC |
110 ms |
2420 KB |
008.txt |
AC |
110 ms |
2420 KB |
009.txt |
AC |
110 ms |
2420 KB |
010.txt |
AC |
110 ms |
2420 KB |
011.txt |
AC |
110 ms |
2420 KB |
example0.txt |
AC |
3 ms |
256 KB |
example1.txt |
AC |
3 ms |
256 KB |