Submission #3373902
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; const int MOD = 1000000007; int main(){ int N; while(cin >> N){ vector<pair<int,int>> p(2*N); for(int i=0;i<2*N;i++){ cin >> p[i].first; p[i].second = (i < N ? 1 : -1); } sort(p.begin(), p.end()); int sum = 0; long long res = 1; for(const auto& pr : p){ if(sum * pr.second < 0){ res *= abs(sum); res %= MOD; } sum += pr.second; } cout << res << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | pes |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 641 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 | 57 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 | 85 ms | 1664 KB |
005.txt | AC | 95 ms | 1792 KB |
006.txt | AC | 95 ms | 1792 KB |
007.txt | AC | 95 ms | 1792 KB |
008.txt | AC | 95 ms | 1792 KB |
009.txt | AC | 95 ms | 1792 KB |
010.txt | AC | 96 ms | 1792 KB |
011.txt | AC | 94 ms | 1792 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |