Submission #2526297
Source Code Expand
#include <bits/stdc++.h> using std::cout; using std::endl; using std::cin; int main(){ int n; cin >> n; std::vector<std::pair<int, int>> vec; for(int i = 0; i < n; i++){ int a; cin >> a; vec.push_back({a, 0}); } for(int i = 0; i < n; i++){ int a; cin >> a; vec.push_back({a, 1}); } sort(begin(vec), end(vec)); const int MOD = 1e9 + 7; long A[2] = {}, ans = 1; for(int i = 0; i < 2 * n; i++){ if(A[1 - vec[i].second]) { ans *= A[1 - vec[i].second]; A[1 - vec[i].second]--; ans %= MOD; }else{ A[vec[i].second]++; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | ecasdqina |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 631 Byte |
Status | AC |
Exec Time | 96 ms |
Memory | 2420 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 | 1400 KB |
001.txt | AC | 22 ms | 892 KB |
002.txt | AC | 30 ms | 892 KB |
003.txt | AC | 33 ms | 1400 KB |
004.txt | AC | 86 ms | 2420 KB |
005.txt | AC | 96 ms | 2420 KB |
006.txt | AC | 96 ms | 2420 KB |
007.txt | AC | 96 ms | 2420 KB |
008.txt | AC | 96 ms | 2420 KB |
009.txt | AC | 96 ms | 2420 KB |
010.txt | AC | 96 ms | 2420 KB |
011.txt | AC | 95 ms | 2420 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |