Submission #402371
Source Code Expand
#include <iostream> #include <stdio.h> #include <string.h> using namespace std; int r[110000]; int c[110000]; int rs[110000]; int cs[110000]; int rc[110000]; int cc[110000]; int main(void) { int R, C, K, N; cin >> R >> C >> K >> N; int i; for(i = 0 ; i < N ; i++) { cin >> r[i] >> c[i]; r[i]--;c[i]--; } for(i = 0 ; i < R ; i++) { rs[i] = 0; } for(i = 0 ; i < C ; i++) { cs[i] = 0; } for(i = 0 ; i < N ; i++) { rs[r[i]]++; cs[c[i]]++; } long long sum = 0; for(i = 0 ; i < N ; i++) { if(rs[r[i]] + cs[c[i]] == K+1) { sum++; } if(rs[r[i]] + cs[c[i]] == K) { sum--; } } for(i = 0 ; i < 100001 ; i++) { rc[i] = 0; cc[i] = 0; } for(i = 0 ; i < R ; i++) { rc[rs[i]]++; } for(i = 0 ; i < C ; i++) { cc[cs[i]]++; } for(i = 0 ; i <= K ; i++) { sum += (long long)rc[i] * cc[K-i]; } cout << sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | tokusin |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 955 Byte |
Status | AC |
Exec Time | 133 ms |
Memory | 3108 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 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 | 24 ms | 1568 KB |
subtask0-sample02.txt | AC | 24 ms | 1568 KB |
subtask0-sample03.txt | AC | 24 ms | 1568 KB |
subtask1-01.txt | AC | 24 ms | 1692 KB |
subtask1-02.txt | AC | 24 ms | 1692 KB |
subtask1-03.txt | AC | 24 ms | 1564 KB |
subtask1-04.txt | AC | 25 ms | 1568 KB |
subtask1-05.txt | AC | 26 ms | 1604 KB |
subtask1-06.txt | AC | 25 ms | 1572 KB |
subtask1-07.txt | AC | 24 ms | 1572 KB |
subtask1-08.txt | AC | 25 ms | 1692 KB |
subtask1-09.txt | AC | 25 ms | 1696 KB |
subtask1-10.txt | AC | 27 ms | 1568 KB |
subtask1-11.txt | AC | 24 ms | 1692 KB |
subtask1-12.txt | AC | 27 ms | 1572 KB |
subtask1-13.txt | AC | 26 ms | 1564 KB |
subtask1-14.txt | AC | 28 ms | 1572 KB |
subtask1-15.txt | AC | 26 ms | 1700 KB |
subtask2-01.txt | AC | 28 ms | 1696 KB |
subtask2-02.txt | AC | 27 ms | 1576 KB |
subtask2-03.txt | AC | 49 ms | 1832 KB |
subtask2-04.txt | AC | 107 ms | 2716 KB |
subtask2-05.txt | AC | 114 ms | 2712 KB |
subtask2-06.txt | AC | 129 ms | 3108 KB |
subtask2-07.txt | AC | 100 ms | 2332 KB |
subtask2-08.txt | AC | 128 ms | 3104 KB |
subtask2-09.txt | AC | 130 ms | 3104 KB |
subtask2-10.txt | AC | 128 ms | 3108 KB |
subtask2-11.txt | AC | 127 ms | 3104 KB |
subtask2-12.txt | AC | 128 ms | 3100 KB |
subtask2-13.txt | AC | 131 ms | 3088 KB |
subtask2-14.txt | AC | 128 ms | 3092 KB |
subtask2-15.txt | AC | 133 ms | 3104 KB |