Submission #2011368


Source Code Expand

#include "bits/stdc++.h"

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back

using namespace std;

using ll = long long;
using P = pair<int,int>;

const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll LINF=1LL<<60, lmod = 1e9+7;

const int MAX_N = 100005;
ll fact[MAX_N];
vector<P> vec;

int main(){
  ll N; cin >> N;
  fact[0] = 1LL;
  rep(i,N) (fact[i+1] = ll(i+1) * fact[i]) %= lmod;
  rep(i,N){
    int a; scanf("%d",&a);
    vec.pb(P(a,1));
  }
  rep(i,N){
    int a; scanf("%d",&a);
    vec.pb(P(a,-1));
  }
  sort(ALL(vec));
  ll ans = 1LL;
  int m_abs = -INF, temp = 0;
  rep(i,2*N){
    temp += vec[i].second;
    m_abs = max(m_abs,abs(temp));
    if(temp==0){
      // cout << m_abs << "," << fact[m_abs] << endl;
      (ans *= fact[m_abs]) %= lmod;
      m_abs = 0;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User kurarrr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1119 Byte
Status WA
Exec Time 41 ms
Memory 3188 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int a; scanf("%d",&a);
                          ^
./Main.cpp:33:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int a; scanf("%d",&a);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 4
WA × 10
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 25 ms 1912 KB
001.txt WA 10 ms 1020 KB
002.txt WA 13 ms 1148 KB
003.txt WA 15 ms 1656 KB
004.txt WA 37 ms 3060 KB
005.txt WA 41 ms 3188 KB
006.txt WA 41 ms 3188 KB
007.txt WA 41 ms 3188 KB
008.txt WA 41 ms 3188 KB
009.txt WA 41 ms 3188 KB
010.txt AC 41 ms 3188 KB
011.txt AC 41 ms 3188 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB