Submission #2557879
Source Code Expand
#include <bits/stdc++.h> #define int long long #define r(i,n) for(int i=0;i<n;i++) using namespace std; int h_c[100009],w_c[100009]; int y[100009],x[100009]; int a[100009],b[100009],sum; main(){ int h,w,k,n; cin>>h>>w>>k>>n; r(i,n){ cin>>y[i]>>x[i]; h_c[(int)y[i]]++; w_c[(int)x[i]]++; } r(i,h)a[h_c[i+1]]++; r(i,w)b[w_c[i+1]]++; r(i,k+1)sum+=a[i]*b[k-i]; r(i,n){ if(h_c[y[i]]+w_c[x[i]]==k)sum--; if(h_c[y[i]]+w_c[x[i]]==k+1)sum++; } cout<<sum<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | c7c7 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 497 Byte |
Status | AC |
Exec Time | 59 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 | 2304 KB |
subtask0-sample02.txt | AC | 2 ms | 2304 KB |
subtask0-sample03.txt | AC | 2 ms | 2304 KB |
subtask1-01.txt | AC | 2 ms | 2304 KB |
subtask1-02.txt | AC | 2 ms | 2304 KB |
subtask1-03.txt | AC | 2 ms | 2304 KB |
subtask1-04.txt | AC | 2 ms | 2304 KB |
subtask1-05.txt | AC | 2 ms | 2304 KB |
subtask1-06.txt | AC | 2 ms | 2304 KB |
subtask1-07.txt | AC | 2 ms | 2304 KB |
subtask1-08.txt | AC | 2 ms | 2304 KB |
subtask1-09.txt | AC | 2 ms | 2304 KB |
subtask1-10.txt | AC | 2 ms | 2304 KB |
subtask1-11.txt | AC | 2 ms | 2304 KB |
subtask1-12.txt | AC | 2 ms | 2304 KB |
subtask1-13.txt | AC | 2 ms | 2304 KB |
subtask1-14.txt | AC | 2 ms | 2304 KB |
subtask1-15.txt | AC | 2 ms | 2304 KB |
subtask2-01.txt | AC | 2 ms | 2304 KB |
subtask2-02.txt | AC | 3 ms | 2304 KB |
subtask2-03.txt | AC | 15 ms | 2560 KB |
subtask2-04.txt | AC | 45 ms | 2816 KB |
subtask2-05.txt | AC | 50 ms | 2816 KB |
subtask2-06.txt | AC | 59 ms | 3328 KB |
subtask2-07.txt | AC | 42 ms | 2816 KB |
subtask2-08.txt | AC | 57 ms | 3328 KB |
subtask2-09.txt | AC | 58 ms | 3328 KB |
subtask2-10.txt | AC | 57 ms | 3328 KB |
subtask2-11.txt | AC | 58 ms | 3328 KB |
subtask2-12.txt | AC | 59 ms | 3328 KB |
subtask2-13.txt | AC | 57 ms | 3328 KB |
subtask2-14.txt | AC | 57 ms | 3328 KB |
subtask2-15.txt | AC | 57 ms | 3328 KB |