Submission #2443852
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <utility> #include <cmath> using namespace std; typedef pair<int,int> P; typedef long long ll; ll N,a; ll inf = 1e9+7; int main(){ cin >> N; vector<P> v(2*N); for(int i=0;i<2*N;i++){ if(i<N){ cin >> a; v[i] = P(a,1); }else{ cin >> a; v[i] = P(a,-1); } } sort(v.begin(),v.end()); ll c = 0; ll ans = 1; for(int i=0;i<2*N;i++){ if(c*v[i].second>=0){ c += v[i].second; }else{ (ans *= abs(c))%inf; if(c>0) c--; else c++; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | idsigma |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 596 Byte |
Status | WA |
Exec Time | 100 ms |
Memory | 1792 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 | 58 ms | 1152 KB |
001.txt | WA | 21 ms | 640 KB |
002.txt | WA | 30 ms | 768 KB |
003.txt | WA | 33 ms | 768 KB |
004.txt | WA | 85 ms | 1664 KB |
005.txt | WA | 95 ms | 1792 KB |
006.txt | WA | 95 ms | 1792 KB |
007.txt | WA | 100 ms | 1792 KB |
008.txt | WA | 95 ms | 1792 KB |
009.txt | WA | 95 ms | 1792 KB |
010.txt | WA | 95 ms | 1792 KB |
011.txt | AC | 94 ms | 1792 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |