Submission #2012396
Source Code Expand
/** * code generated by JHelper * More info: https://github.com/AlexeyDmitriev/JHelper * @author ei13333 */ #include <bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; class TaskA { public: void solve(istream &cin, ostream &cout) { int N; cin >> N; vector < pair < int, int > > D(N + N); for(int i = 0; i < N; i++) { cin >> D[i].first; D[i].second = 0; } for(int i = 0; i < N; i++) { cin >> D[i + N].first; D[i + N].second = 1; } sort(begin(D), end(D)); int inA = 0, inB = 0; int64 ret = 1; for(auto &p : D) { if(p.second == 0) { if(inB == 0) { ++inA; } else { (ret *= inB--) %= mod; } } else { if(inA == 0) { ++inB; } else { (ret *= inA--) %= mod; } } } cout << ret << endl; } }; int main() { TaskA solver; std::istream &in(std::cin); std::ostream &out(std::cout); solver.solve(in, out); return (0); }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | ei13333 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1113 Byte |
Status | AC |
Exec Time | 99 ms |
Memory | 1792 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 | 58 ms | 1152 KB |
001.txt | AC | 22 ms | 640 KB |
002.txt | AC | 30 ms | 768 KB |
003.txt | AC | 34 ms | 768 KB |
004.txt | AC | 90 ms | 1664 KB |
005.txt | AC | 99 ms | 1792 KB |
006.txt | AC | 99 ms | 1792 KB |
007.txt | AC | 96 ms | 1792 KB |
008.txt | AC | 96 ms | 1792 KB |
009.txt | AC | 96 ms | 1792 KB |
010.txt | AC | 96 ms | 1792 KB |
011.txt | AC | 96 ms | 1792 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |