Submission #3228151
Source Code Expand
// template version 1.2
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
// #define INF 2147483647
#define INF 1000000000000000000LL
#define MOD 1000000007LL
// {{{ define basic macro
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define foreach(x,a) for(auto& (x) : (a) )
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0LL)
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
template<typename A, size_t N, typename T> // n次元配列の初期化。第2引数の型のサイズごとに初期化していく。
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
template <class T = int>
T in() {T x; cin>>x; return (x);}
struct Fast {
Fast(){
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
// }}}
//{{{ dump macro
#ifdef PCM
#include "dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#endif
//}}}
//{{{ others
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
//}}}
int solve(){
int n;cin>>n;
int a[n]; rep(i, n) {cin>>a[i];}
int b[n]; rep(i, n) {cin>>b[i];}
sort(a, a+n);
sort(b, b+n);
int c[n]; rep(i, n){
c[i] = max(a[i], b[i]);
}
int dp[n]={};
dp[0] = 1;
rep(i, 1, n){
int d = i - (lower_bound(c, c+i, min(a[i], b[i])) - c);
dump(i, d);
dp[i] = (1+d)*dp[i-1];
dp[i] %= MOD;
}
cout << dp[n-1] << endl;
return 0;
}
int test(){ //{{{
return 0;
}
//}}}
signed main() { //{{{
#ifdef INPUT_FROM_FILE
std::ifstream in(infile);
std::cin.rdbuf(in.rdbuf());
#endif
#ifdef PCM
test();
#endif
solve();
return 0;
} //}}}
Submission Info
Submission Time |
|
Task |
A - 1D Matching |
User |
kjnh10 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2583 Byte |
Status |
AC |
Exec Time |
37 ms |
Memory |
3328 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 |
2176 KB |
001.txt |
AC |
9 ms |
896 KB |
002.txt |
AC |
12 ms |
1280 KB |
003.txt |
AC |
13 ms |
1280 KB |
004.txt |
AC |
33 ms |
3072 KB |
005.txt |
AC |
37 ms |
3328 KB |
006.txt |
AC |
37 ms |
3328 KB |
007.txt |
AC |
37 ms |
3328 KB |
008.txt |
AC |
37 ms |
3328 KB |
009.txt |
AC |
37 ms |
3328 KB |
010.txt |
AC |
36 ms |
3328 KB |
011.txt |
AC |
37 ms |
3328 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |