Submission #3441606


Source Code Expand

import java.util.*;
import java.io.*;
 
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
 
public class Main{
    static final long mod=1000000007;
    
    public  static void main(String[] args)   throws Exception, IOException{
        Reader sc = new Reader(System.in);
        PrintWriter out=new PrintWriter(System.out);
        // int n=sc.nextInt();
        // char c[][] = new char[h][w];
        // char c[]=sc.nextString().toCharArray();
        // int d[]=new int[n];
        // for(int i=0; i<n; i++) {d[i]=sc.nextInt();}

        int n=sc.nextInt();
        long d[] = new long[n*2];
   
        
        
        for (int i = 0; i < n; i++) {
        	d[i] = sc.nextLong()<<40;
        }
        for (int i = 0; i < n; i++) {
        	d[i+n] = sc.nextLong()<<40;
        	d[i+n] += 1;
        }
        sort(d);
        
        int p=0,q=0;
        long ans=1;
        for (int i = 0; i < n*2; i++) {
        	if(d[i]%2==1) {if(q>0) {ans*=q;ans%=mod;q--;} else p++; }
        	else {
        		if(p>0) {ans*=p; ans%=mod; p--;} else q++;
        	}
        }

        out.println(ans);
        out.flush();
    }

    static void db(Object... os){
        System.err.println(Arrays.deepToString(os));
    }  
}

class P implements Comparable<P>{
    int id, d;
    P(int  id, int d) {
        this.id=id;
        this.d=d;
    }
    public int compareTo(P p){
        return d-p.d; //des
    }
}

class Reader
{ 
    private BufferedReader x;
    private StringTokenizer st;
    
    public Reader(InputStream in)
    {
        x = new BufferedReader(new InputStreamReader(in));
        st = null;
    }
    public String nextString() throws IOException
    {
        while( st==null || !st.hasMoreTokens() )
            st = new StringTokenizer(x.readLine());
        return st.nextToken();
    }
    public int nextInt() throws IOException
    {
        return Integer.parseInt(nextString());
    }
    public long nextLong() throws IOException
    {
        return Long.parseLong(nextString());
    }
    public double nextDouble() throws IOException
    {
        return Double.parseDouble(nextString());
    }
}

Submission Info

Submission Time
Task A - 1D Matching
User mukku
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2278 Byte
Status WA
Exec Time 271 ms
Memory 43576 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 2
WA × 12
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 224 ms 37576 KB
001.txt WA 166 ms 26752 KB
002.txt WA 183 ms 30316 KB
003.txt WA 199 ms 32304 KB
004.txt WA 256 ms 43436 KB
005.txt WA 270 ms 41440 KB
006.txt WA 255 ms 40700 KB
007.txt WA 271 ms 43576 KB
008.txt WA 265 ms 42944 KB
009.txt WA 265 ms 41004 KB
010.txt WA 261 ms 41380 KB
011.txt WA 267 ms 39956 KB
example0.txt AC 71 ms 20692 KB
example1.txt AC 71 ms 18388 KB