Submission #1482043
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; using llng = long long; template<typename T> using v = vector<T>; template<typename T> using vv = v<v<T> >; int main() { int R, C, K; cin >> R >> C >> K; int N; cin >> N; v<int> r(N), c(N); v<int> r_count(R+1), c_count(C+1); for (int i=0; i<N; i++) { cin >> r[i] >> c[i]; r_count[r[i]]++; c_count[c[i]]++; } v<int> count_r(N+1), count_c(N+1); for (int r=1; r<=R; r++) count_r[r_count[r]]++; for (int c=1; c<=C; c++) count_c[c_count[c]]++; llng ans = 0; for (int k=0; k<=K; k++) if (k <= R && K-k <= C){ ans += count_r[k] * count_c[K-k]; } for (int i=0; i<N; i++) { if (r_count[r[i]] + c_count[c[i]] == K) ans--; if (r_count[r[i]] + c_count[c[i]] == K+1) ans++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | hidollara |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 929 Byte |
Status | AC |
Exec Time | 64 ms |
Memory | 2560 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 | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask0-sample03.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |
subtask2-01.txt | AC | 2 ms | 256 KB |
subtask2-02.txt | AC | 2 ms | 256 KB |
subtask2-03.txt | AC | 16 ms | 768 KB |
subtask2-04.txt | AC | 46 ms | 2304 KB |
subtask2-05.txt | AC | 52 ms | 2176 KB |
subtask2-06.txt | AC | 58 ms | 2560 KB |
subtask2-07.txt | AC | 43 ms | 1792 KB |
subtask2-08.txt | AC | 59 ms | 2560 KB |
subtask2-09.txt | AC | 59 ms | 2560 KB |
subtask2-10.txt | AC | 59 ms | 2560 KB |
subtask2-11.txt | AC | 59 ms | 2560 KB |
subtask2-12.txt | AC | 64 ms | 2560 KB |
subtask2-13.txt | AC | 59 ms | 2560 KB |
subtask2-14.txt | AC | 59 ms | 2560 KB |
subtask2-15.txt | AC | 58 ms | 2560 KB |