Submission #2012400
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
template <typename T> using vector2d = vector<vector<T>>;
// clang-format off
template <typename T> void sort(vector<T> &v) { sort(all(v)); }
// ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }
// ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }
struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup;
inline int64_t in() { int64_t x = 0; cin >> x; return x; }
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on
const int mod = 1e9 + 7;
signed main(int argc, char *argv[]) {
int n = in();
vector<int> fact(n + 1, 1);
for (int64_t i = 1; i <= n; ++i) {
fact[i] = fact[i - 1] * i % mod;
}
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
v.pb(in(), 0);
}
for (int i = 0; i < n; ++i) {
v.pb(in(), 1);
}
v.pb(inf, 1);
sort(v);
int ans = 1, a = 0, b = 0;
for (int i = 0; i < v.size(); ++i) {
if (v[i].sc) {
if (a > b) {
ans *= fact[a - b];
ans %= mod;
}
b++;
} else {
a++;
}
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
A - 1D Matching |
User |
Luzhiled |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3216 Byte |
Status |
WA |
Exec Time |
39 ms |
Memory |
2804 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 |
24 ms |
1656 KB |
001.txt |
WA |
9 ms |
1020 KB |
002.txt |
WA |
12 ms |
1020 KB |
003.txt |
WA |
14 ms |
1528 KB |
004.txt |
WA |
35 ms |
2804 KB |
005.txt |
WA |
39 ms |
2804 KB |
006.txt |
WA |
39 ms |
2804 KB |
007.txt |
WA |
39 ms |
2804 KB |
008.txt |
WA |
39 ms |
2804 KB |
009.txt |
WA |
39 ms |
2804 KB |
010.txt |
WA |
38 ms |
2804 KB |
011.txt |
AC |
39 ms |
2804 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |