Submission #402638
Source Code Expand
#include<iostream> #include<vector> #include<cstring> using namespace std; const int BUF = 100005; int nRow, nCol, K; vector<int> row2col[BUF]; int col2cnt[BUF]; int cnt2cnt[BUF]; void read() { for (int i = 0; i < BUF; ++i) row2col[i].clear(); memset(col2cnt, 0, sizeof(col2cnt)); memset(cnt2cnt, 0, sizeof(cnt2cnt)); cin >> nRow >> nCol >> K; int nPt; cin >> nPt; for (int i = 0; i < nPt; ++i) { int r, c; cin >> r >> c; --r; --c; row2col[r].push_back(c); ++col2cnt[c]; } for (int i = 0; i < nCol; ++i) ++cnt2cnt[col2cnt[i]]; } void work() { long long ans = 0; for (int r = 0; r < nRow; ++r) { if (K >= row2col[r].size()) ans += cnt2cnt[K - row2col[r].size()]; for (int i = 0; i < row2col[r].size(); ++i) { int col = row2col[r][i]; if (col2cnt[col] == K - row2col[r].size()) --ans; if (col2cnt[col] == K - row2col[r].size() + 1) ++ans; } } cout << ans << endl; } int main() { read(); work(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | Hachimori |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 1232 Byte |
Status | AC |
Exec Time | 162 ms |
Memory | 6412 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 | 40 ms | 4216 KB |
subtask0-sample02.txt | AC | 38 ms | 4368 KB |
subtask0-sample03.txt | AC | 41 ms | 4364 KB |
subtask1-01.txt | AC | 39 ms | 4220 KB |
subtask1-02.txt | AC | 38 ms | 4356 KB |
subtask1-03.txt | AC | 38 ms | 4216 KB |
subtask1-04.txt | AC | 40 ms | 4220 KB |
subtask1-05.txt | AC | 40 ms | 4384 KB |
subtask1-06.txt | AC | 39 ms | 4368 KB |
subtask1-07.txt | AC | 38 ms | 4232 KB |
subtask1-08.txt | AC | 39 ms | 4216 KB |
subtask1-09.txt | AC | 40 ms | 4228 KB |
subtask1-10.txt | AC | 40 ms | 4232 KB |
subtask1-11.txt | AC | 38 ms | 4220 KB |
subtask1-12.txt | AC | 39 ms | 4224 KB |
subtask1-13.txt | AC | 39 ms | 4240 KB |
subtask1-14.txt | AC | 38 ms | 4216 KB |
subtask1-15.txt | AC | 39 ms | 4360 KB |
subtask2-01.txt | AC | 41 ms | 4224 KB |
subtask2-02.txt | AC | 42 ms | 4388 KB |
subtask2-03.txt | AC | 64 ms | 4492 KB |
subtask2-04.txt | AC | 121 ms | 4892 KB |
subtask2-05.txt | AC | 129 ms | 5004 KB |
subtask2-06.txt | AC | 153 ms | 6268 KB |
subtask2-07.txt | AC | 118 ms | 5004 KB |
subtask2-08.txt | AC | 162 ms | 6280 KB |
subtask2-09.txt | AC | 154 ms | 6268 KB |
subtask2-10.txt | AC | 162 ms | 6284 KB |
subtask2-11.txt | AC | 160 ms | 6412 KB |
subtask2-12.txt | AC | 159 ms | 6280 KB |
subtask2-13.txt | AC | 159 ms | 6280 KB |
subtask2-14.txt | AC | 161 ms | 6284 KB |
subtask2-15.txt | AC | 161 ms | 6308 KB |