Submission #402355
Source Code Expand
object Main { def main(args: Array[String]): Unit = { val sc = new java.util.Scanner(System.in) val R,C,K = sc.nextInt val N = sc.nextInt val r, c = new Array[Int](N) // tate(x): x行目に存在する飴の数 val tate = new Array[Int](R) // yoko(y): y列目に存在する飴の数 val yoko = new Array[Int](C) // tateAme(x): その行に飴がx個存在する行の数 val tateAme = new Array[Int](K+1) // yokoAme(x): その列に飴がy個存在する列の数 val yokoAme = new Array[Int](K+1) for (i <- 0 to N - 1) { r(i) = sc.nextInt - 1 c(i) = sc.nextInt - 1 tate(r(i)) += 1 yoko(c(i)) += 1 } var ans: Int = 0; for (i <- 0 to R - 1) { if (tate(i) <= K) tateAme(tate(i)) += 1 } for (i <- 0 to C - 1) { if (yoko(i) <= K) yokoAme(yoko(i)) += 1 } for (i <- 0 to K) { ans += tateAme(i) * yokoAme(K - i) } for (i <- 0 to N - 1) { val sum = tate(r(i)) + yoko(c(i)) if (sum == K) ans -= 1 else if (sum == K + 1) ans += 1 } println(ans) } }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | uriku |
Language | Scala (2.11.5) |
Score | 30 |
Code Size | 1348 Byte |
Status | WA |
Exec Time | 1718 ms |
Memory | 64360 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 1099 ms | 47900 KB |
subtask0-sample02.txt | AC | 1037 ms | 47756 KB |
subtask0-sample03.txt | AC | 1037 ms | 48068 KB |
subtask1-01.txt | AC | 1030 ms | 47872 KB |
subtask1-02.txt | AC | 1032 ms | 48064 KB |
subtask1-03.txt | AC | 1053 ms | 47964 KB |
subtask1-04.txt | AC | 999 ms | 47996 KB |
subtask1-05.txt | AC | 1017 ms | 48056 KB |
subtask1-06.txt | AC | 1041 ms | 47872 KB |
subtask1-07.txt | AC | 1028 ms | 48132 KB |
subtask1-08.txt | AC | 1023 ms | 48160 KB |
subtask1-09.txt | AC | 1022 ms | 48108 KB |
subtask1-10.txt | AC | 1044 ms | 48048 KB |
subtask1-11.txt | AC | 1033 ms | 48100 KB |
subtask1-12.txt | AC | 1039 ms | 48152 KB |
subtask1-13.txt | AC | 1042 ms | 47960 KB |
subtask1-14.txt | AC | 1039 ms | 48032 KB |
subtask1-15.txt | AC | 1048 ms | 48124 KB |
subtask2-01.txt | AC | 1322 ms | 50648 KB |
subtask2-02.txt | AC | 1376 ms | 53776 KB |
subtask2-03.txt | AC | 1541 ms | 61452 KB |
subtask2-04.txt | AC | 1605 ms | 63228 KB |
subtask2-05.txt | AC | 1624 ms | 62620 KB |
subtask2-06.txt | WA | 1666 ms | 63460 KB |
subtask2-07.txt | AC | 1573 ms | 62268 KB |
subtask2-08.txt | AC | 1718 ms | 63408 KB |
subtask2-09.txt | AC | 1666 ms | 62496 KB |
subtask2-10.txt | WA | 1634 ms | 63360 KB |
subtask2-11.txt | WA | 1679 ms | 63292 KB |
subtask2-12.txt | AC | 1673 ms | 62864 KB |
subtask2-13.txt | AC | 1671 ms | 64360 KB |
subtask2-14.txt | WA | 1660 ms | 63052 KB |
subtask2-15.txt | AC | 1622 ms | 62824 KB |