Submission #1244173


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
#include <fstream>
using namespace std;

#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 REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
#define MOD 1000000007

int main() {
    
    ll N; cin >> N;
    vector<ll> a(N),b(N);
    REP(i,N) cin >> a[i];
    REP(i,N) cin >> b[i];
    
    vector< pair<ll,ll> > p(N*2);
    REP(i,N) p[i] = make_pair(a[i],0);
    REP(i,N) p[i+N] = make_pair(b[i],1);
    
    sort(p.begin(),p.end());
    
    ll cntF = 0;
    ll cntB = 0;
    ll ans = 1;
    REP(i,N*2) {
        ll f = p[i].second;
        if(f==1) {
            if(cntF > 0) {
                ans *= cntF;
                cntF--;
            } else {
                cntB++;
            }
        } else {
            if(cntB > 0) {
                ans *= cntB;
                cntB--;
            } else {
                cntF++;
            }
        }
        ans %= MOD;
    }
    
    cout << ans << endl;
    
    return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User kosakkun
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1589 Byte
Status AC
Exec Time 97 ms
Memory 4992 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 14
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 59 ms 3072 KB
001.txt AC 22 ms 1280 KB
002.txt AC 30 ms 1664 KB
003.txt AC 33 ms 1792 KB
004.txt AC 86 ms 4480 KB
005.txt AC 97 ms 4992 KB
006.txt AC 97 ms 4992 KB
007.txt AC 97 ms 4992 KB
008.txt AC 96 ms 4992 KB
009.txt AC 97 ms 4992 KB
010.txt AC 96 ms 4992 KB
011.txt AC 96 ms 4992 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB