Submission #2559008
Source Code Expand
#include <iostream> #include <vector> using namespace std; typedef pair<int, int> P; typedef long long ll; const int MAX_N = 100010; int rcnt[MAX_N], ccnt[MAX_N]; int _rcnt[MAX_N], _ccnt[MAX_N]; int main() { int R, C, r, c, k, n; vector<P> v; cin >> R >> C >> k >> n; for (int i=0;i<n;i++) { cin >> r >> c; r--;c--; rcnt[r]++; ccnt[c]++; v.push_back(P(r, c)); } for (int i=0;i<R;i++) { _rcnt[rcnt[i]]++; } for (int i=0;i<C;i++) { _ccnt[ccnt[i]]++; } ll cnt = 0; for (int i=0;i<=k;i++) { cnt += _rcnt[i] * _ccnt[k-i]; } for (int i=0;i<n;i++) { int pcnt = rcnt[v[i].first] + ccnt[v[i].second]; if (pcnt == k) { cnt--; } else if (pcnt == k + 1) { cnt++; } } cout << cnt << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | hashmup |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 899 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 2168 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 | 15 ms | 640 KB |
subtask2-04.txt | AC | 46 ms | 1656 KB |
subtask2-05.txt | AC | 51 ms | 1784 KB |
subtask2-06.txt | AC | 58 ms | 2168 KB |
subtask2-07.txt | AC | 43 ms | 1400 KB |
subtask2-08.txt | AC | 58 ms | 2168 KB |
subtask2-09.txt | AC | 58 ms | 2168 KB |
subtask2-10.txt | AC | 58 ms | 2168 KB |
subtask2-11.txt | AC | 58 ms | 2168 KB |
subtask2-12.txt | AC | 58 ms | 2168 KB |
subtask2-13.txt | AC | 58 ms | 2168 KB |
subtask2-14.txt | AC | 58 ms | 2168 KB |
subtask2-15.txt | AC | 58 ms | 2168 KB |