Submission #1992208
Source Code Expand
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n;
vpii v;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
FOR(k, 0, 2){
FOR(i, 0, n){
int a;
cin >> a;
v.pb(mp(a, k));
}
}
sort(rng(v));
int d = 0;
ll ans = 1;
each(itr, v){
if(itr->se){
if(d < 0) ans = ans*(-d)%mod;
d++;
}else{
if(d > 0) ans = ans*d%mod;
d--;
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 1D Matching |
User |
char134217728 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1875 Byte |
Status |
AC |
Exec Time |
39 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 |
24 ms |
1400 KB |
001.txt |
AC |
9 ms |
892 KB |
002.txt |
AC |
12 ms |
892 KB |
003.txt |
AC |
14 ms |
1400 KB |
004.txt |
AC |
35 ms |
2420 KB |
005.txt |
AC |
39 ms |
2420 KB |
006.txt |
AC |
39 ms |
2420 KB |
007.txt |
AC |
39 ms |
2420 KB |
008.txt |
AC |
39 ms |
2420 KB |
009.txt |
AC |
39 ms |
2420 KB |
010.txt |
AC |
38 ms |
2420 KB |
011.txt |
AC |
39 ms |
2420 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |