Submission #3226300
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define i_7 (ll)(1E9+7) #define i_5 (ll)(1E9+5) ll mod(ll a){ ll c=a%i_7; if(c>=0)return c; else return c+i_7; } typedef pair<int,int> i_i; typedef pair<ll,ll> l_l; ll inf=(ll)1E12;//10^12 #define rep(i,l,r) for(ll i=l;i<=r;i++) #define pb push_back ll max(ll a,ll b){if(a<b)return b;else return a;} ll min(ll a,ll b){if(a>b)return b;else return a;} //////////////////////////////////////// #define N 200004 ll kai[N]; ll kai2[N]; ll po(ll i,ll p){ if(p==0)return 1; else if(p==1)return mod(i); else if(p%2==0)return mod(po(mod(mod(i)*mod(i)),p/2)); else return mod(mod(i)*mod(po(i,p-1))); } void calc(){ kai[0]=1; kai2[0]=1; for(int i=1;i<N;i++){ kai[i]=mod(kai[i-1]*i); kai2[i]=mod(po(kai[i],i_5)); } } ll comb(ll n,ll k){ if(n==0){ if(k==0)return 1; else return 0; } else if(n<k)return 0; else return mod(mod(mod(kai[n])*mod(kai2[n-k]))*mod(kai2[k])); } int main(){ ios::sync_with_stdio(false);cin.tie(0); calc(); int n;cin>>n; i_i a[2*n]; rep(i,0,n-1){ int b;cin>>b;a[i]=i_i(b,1); } rep(i,0,n-1){ int b;cin>>b;a[i+n]=i_i(b,2); } sort(a,a+2*n); ll ans=1; int c=0; int d=0; rep(i,0,2*n-1){ a[i].second==1?c++:c--; d++; if(c==0){ d/=2; ans=mod(ans*kai[d]); d=0; } } cout<<mod(ans)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | sugarrr |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1601 Byte |
Status | WA |
Exec Time | 151 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 134 ms | 4352 KB |
001.txt | WA | 121 ms | 3712 KB |
002.txt | WA | 124 ms | 3840 KB |
003.txt | WA | 125 ms | 3968 KB |
004.txt | WA | 145 ms | 4736 KB |
005.txt | WA | 148 ms | 4992 KB |
006.txt | WA | 149 ms | 4992 KB |
007.txt | WA | 151 ms | 4992 KB |
008.txt | WA | 148 ms | 4992 KB |
009.txt | WA | 148 ms | 4992 KB |
010.txt | AC | 148 ms | 4992 KB |
011.txt | AC | 148 ms | 4992 KB |
example0.txt | AC | 114 ms | 3328 KB |
example1.txt | AC | 114 ms | 3328 KB |