Submission #3514585
Source Code Expand
#include <algorithm> #include <iostream> #include <vector> using namespace std; const int inf=1e9+7; int main() { int N; cin>>N; vector <pair<int,int> > V; for(int i=-1;i<=1;i+=2) { for(int j=0;j<N;j++) { int x; cin>>x; V.push_back(make_pair(x,i)); } } sort(V.begin(),V.end()); int cnt=0; long long ans=1; for(int i=0;i<2*N;i++) { if(cnt*V[i].second<0) { ans*=abs(cnt); ans%=inf; } cnt+=V[i].second; } cout<<ans<<"\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | GreenHat |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 507 Byte |
Status | AC |
Exec Time | 98 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 | 97 ms | 2420 KB |
006.txt | AC | 97 ms | 2420 KB |
007.txt | AC | 96 ms | 2420 KB |
008.txt | AC | 98 ms | 2420 KB |
009.txt | AC | 97 ms | 2420 KB |
010.txt | AC | 96 ms | 2420 KB |
011.txt | AC | 96 ms | 2420 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |