Submission #4982169
Source Code Expand
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
using namespace std;
template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;
const int MAX_N = 100005;
inline int add(int x,int y)
{
return (x + y)%MOD;
}
inline int sub(int x,int y)
{
return (x+MOD-y)%MOD;
}
inline int mul(int x,int y)
{
return (ll)x*y%MOD;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vp vec(2*n);
rep(i,n){
int a;
cin >> a;
vec[i] = P(a, 0);
}
rep(i,n){
int b;
cin >> b;
vec[n+i] = P(b,1);
}
sort(all(vec));
int ans = 1;
int sm = 0;
rep(i,2*n){
if(vec[i].se){
if(sm < 0){
ans = mul(ans, -sm);
}
sm++;
}else{
if(sm > 0){
ans = mul(ans, sm);
}
sm--;
}
}
cout << ans << "\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 1D Matching |
User |
kopricky |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2451 Byte |
Status |
AC |
Exec Time |
39 ms |
Memory |
1792 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 |
23 ms |
1152 KB |
001.txt |
AC |
9 ms |
640 KB |
002.txt |
AC |
12 ms |
768 KB |
003.txt |
AC |
13 ms |
768 KB |
004.txt |
AC |
34 ms |
1664 KB |
005.txt |
AC |
38 ms |
1792 KB |
006.txt |
AC |
38 ms |
1792 KB |
007.txt |
AC |
37 ms |
1792 KB |
008.txt |
AC |
38 ms |
1792 KB |
009.txt |
AC |
38 ms |
1792 KB |
010.txt |
AC |
39 ms |
1792 KB |
011.txt |
AC |
37 ms |
1792 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |