Submission #2143221
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define REP(i,a) for(int i=0;i<(a);i++) #define MOD 1000000007 int main(){ int N; cin>>N; vector<pair<int,bool>> v(2*N); for(int i=0;i<2*N;i++){ int x; cin>>x; bool y=(i<N); v[i]={x,y}; } sort(v.begin(),v.end()); ll ans=1; int cnt=0; for(int i=0;i<2*N;i++){ int tmp=cnt+(v[i].second?1:-1); if(abs(tmp)<abs(cnt)) (ans*=cnt)%=MOD; cnt=tmp; } cout<<abs(ans)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | misosoup |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 555 Byte |
Status | AC |
Exec Time | 101 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 | 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 | 95 ms | 1792 KB |
008.txt | AC | 96 ms | 1792 KB |
009.txt | AC | 101 ms | 1792 KB |
010.txt | AC | 95 ms | 1792 KB |
011.txt | AC | 95 ms | 1792 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |