Submission #3186668
Source Code Expand
#include <cmath> #include <algorithm> #include <vector> #include <iostream> using namespace std; int main() { int n; cin >> n; vector<pair<int, int> > x(2*n); for (int i = 0; i < 2*n; i++) { int a; cin >> a; x[i] = make_pair(a, i<n?-1:1); } sort(x.begin(), x.end()); int c = 0; long long ans = 1; const int M = (int)1e9 + 7; for (auto p : x) { if (c != 0 && ((p.second > 0) != (c > 0))) ans = ans * abs(c) % M; c += p.second; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | kozima |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 526 Byte |
Status | AC |
Exec Time | 96 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 | 21 ms | 640 KB |
002.txt | AC | 30 ms | 768 KB |
003.txt | AC | 33 ms | 768 KB |
004.txt | AC | 86 ms | 1664 KB |
005.txt | AC | 96 ms | 1792 KB |
006.txt | AC | 96 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 |