Submission #2206175
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <vector> #include <sstream> #include <map> #include <set> #include <queue> #include <algorithm> #include <cmath> #include <cstdlib> #include <cstring> #include <typeinfo> #include <numeric> #include <functional> #include <unordered_map> using namespace std; using ll = long long; using ull = unsigned long long; const ll INF = 1e16; const ll MOD = 1e9 + 7; #define REP(i, n) for(int i = 0; i < n; i++) #define RREP(i, n) for(int i = n - 1; i >= 0; i--) #define REP2(i, n, k) for(int i = 0; i < n; i += k) int main() { int R, C, k, n, r[100000], c[100000]; cin >> R >> C >> k >> n; int y[100000] = {}, x[100000] = {}; REP(i, n){ cin >> r[i] >> c[i]; r[i]--;c[i]--; y[r[i]]++; x[c[i]]++; } ll a[100005] = {}, b[100005] = {}; REP(i, R){ a[y[i]]++; } REP(i, C){ b[x[i]]++; } ll ans = 0; REP(i, k + 1){ ans += a[i] * b[k - i]; } REP(i, n){ if(y[r[i]] + x[c[i]] == k){ ans--; } if(y[r[i]] + x[c[i]] == k + 1){ ans++; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | chocobo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1282 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 3328 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 | 2 ms | 2944 KB |
subtask0-sample02.txt | AC | 2 ms | 2688 KB |
subtask0-sample03.txt | AC | 2 ms | 2560 KB |
subtask1-01.txt | AC | 2 ms | 2560 KB |
subtask1-02.txt | AC | 2 ms | 2816 KB |
subtask1-03.txt | AC | 2 ms | 3328 KB |
subtask1-04.txt | AC | 2 ms | 2560 KB |
subtask1-05.txt | AC | 2 ms | 2560 KB |
subtask1-06.txt | AC | 2 ms | 2560 KB |
subtask1-07.txt | AC | 2 ms | 2560 KB |
subtask1-08.txt | AC | 2 ms | 2560 KB |
subtask1-09.txt | AC | 2 ms | 2560 KB |
subtask1-10.txt | AC | 2 ms | 2560 KB |
subtask1-11.txt | AC | 2 ms | 2560 KB |
subtask1-12.txt | AC | 2 ms | 2688 KB |
subtask1-13.txt | AC | 2 ms | 2816 KB |
subtask1-14.txt | AC | 2 ms | 2560 KB |
subtask1-15.txt | AC | 2 ms | 2560 KB |
subtask2-01.txt | AC | 2 ms | 2560 KB |
subtask2-02.txt | AC | 4 ms | 2560 KB |
subtask2-03.txt | AC | 18 ms | 2944 KB |
subtask2-04.txt | AC | 55 ms | 3328 KB |
subtask2-05.txt | AC | 64 ms | 3328 KB |
subtask2-06.txt | AC | 72 ms | 3328 KB |
subtask2-07.txt | AC | 53 ms | 3328 KB |
subtask2-08.txt | AC | 72 ms | 3328 KB |
subtask2-09.txt | AC | 74 ms | 3328 KB |
subtask2-10.txt | AC | 72 ms | 3328 KB |
subtask2-11.txt | AC | 73 ms | 3328 KB |
subtask2-12.txt | AC | 71 ms | 3328 KB |
subtask2-13.txt | AC | 72 ms | 3328 KB |
subtask2-14.txt | AC | 71 ms | 3328 KB |
subtask2-15.txt | AC | 75 ms | 3328 KB |