Submission #1678147


Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

const int S = 200010;
int N;
int perm[S];

signed main() {
    perm[0] = 1;
    rep(i,1,S) perm[i] = (i * perm[i-1]) % MOD;

    cin >> N;
    vector<pii> vs;
    rep(i,0,N) {
        int p; cin >> p;
        vs.push_back(pii(p, 0));
    }
    rep(i,0,N) {
        int p; cin >> p;
        vs.push_back(pii(p, 1));
    }

    sort(vs.begin(), vs.end());
    int ans = 1;
    int a = 0, b = 0;
    rep(i,0,2*N) {
        int m = vs[i].second;
        (m ? a : b)++;
        if(a == b) {
            (ans *= perm[a]) %= MOD;
            a = b = 0;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User tsutaj
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1706 Byte
Status WA
Exec Time 104 ms
Memory 7408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 4
WA × 10
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 62 ms 3956 KB
001.txt WA 24 ms 2936 KB
002.txt WA 32 ms 2936 KB
003.txt WA 36 ms 3956 KB
004.txt WA 90 ms 6256 KB
005.txt WA 101 ms 6640 KB
006.txt WA 100 ms 7280 KB
007.txt WA 99 ms 6640 KB
008.txt WA 104 ms 7408 KB
009.txt WA 100 ms 6768 KB
010.txt AC 99 ms 7280 KB
011.txt AC 100 ms 6768 KB
example0.txt AC 3 ms 1792 KB
example1.txt AC 3 ms 1792 KB