Submission #1003160
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); long N = sc.nextLong(); long minimum=0; long cnt=0; ArrayList<Long> a = new ArrayList<Long>(); ArrayList<Long> b = new ArrayList<Long>(); for(int i=0;i<N;i++){ a.add(sc.nextLong()); } for(int i=0;i<N;i++){ b.add(sc.nextLong()); } Collections.sort(a); Collections.sort(b); for(int i=0;i<N;i++){ minimum+=Math.abs(a.get(i)-b.get(i)); } cnt++; //System.out.println(minimum); long distance=minimum; int i; for(i=1;minimum==distance&&i<N;i++){ distance=0; distance+=Math.abs(a.get(0)-b.get(i)); for(int j=0;j<i;j++){ distance+=Math.abs(a.get(j+1)-b.get(j)); } for(int k=i+1;k<N;k++){ distance+=Math.abs(a.get(k)-b.get(k)); } if(minimum==distance){ cnt++; } //System.out.println(distance); } System.out.println(cnt); } }
Submission Info
Submission Time | |
---|---|
Task | A - 1D Matching |
User | imoyuki |
Language | Java7 (OpenJDK 1.7.0) |
Score | 0 |
Code Size | 970 Byte |
Status | WA |
Exec Time | 2112 ms |
Memory | 76396 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 | 690 ms | 49760 KB |
001.txt | WA | 573 ms | 32692 KB |
002.txt | WA | 621 ms | 32448 KB |
003.txt | WA | 623 ms | 33528 KB |
004.txt | WA | 813 ms | 60216 KB |
005.txt | WA | 841 ms | 54852 KB |
006.txt | WA | 806 ms | 54888 KB |
007.txt | WA | 827 ms | 55228 KB |
008.txt | WA | 832 ms | 76248 KB |
009.txt | WA | 791 ms | 54996 KB |
010.txt | TLE | 2112 ms | 76396 KB |
011.txt | AC | 853 ms | 75752 KB |
example0.txt | AC | 131 ms | 9044 KB |
example1.txt | AC | 131 ms | 9044 KB |