Submission #2572530
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int,int> P; const double EPS = 1e-12; const int INF = numeric_limits<int>::max()/2; const int MOD = 1e9+7; int main(){ cin.tie(0); ios::sync_with_stdio(false); int R,C,k,n;cin>>R>>C>>k>>n; vector<P> v(n); vector<int> rsum(111111,0),csum(111111,0); for(int i=0;i<n;i++){ int r,c;cin>>r>>c; v[i]=P(r,c); rsum[r]++; csum[c]++; } map<int,int> mp; for(int i=1;i<=R;i++) mp[rsum[i]]++; ll res=0; for(int i=1;i<=C;i++){ int num=csum[i]; res+=mp[k-num]; } for(int i=0;i<n;i++){ int r=v[i].first,c=v[i].second; if(rsum[r]+csum[c]==k) res--; if(rsum[r]+csum[c]-1==k) res++; } cout<<res<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | zaki_ |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 837 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 1920 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 | 1152 KB |
subtask0-sample02.txt | AC | 2 ms | 1152 KB |
subtask0-sample03.txt | AC | 2 ms | 1152 KB |
subtask1-01.txt | AC | 1 ms | 1152 KB |
subtask1-02.txt | AC | 2 ms | 1152 KB |
subtask1-03.txt | AC | 1 ms | 1152 KB |
subtask1-04.txt | AC | 2 ms | 1152 KB |
subtask1-05.txt | AC | 2 ms | 1152 KB |
subtask1-06.txt | AC | 2 ms | 1152 KB |
subtask1-07.txt | AC | 2 ms | 1152 KB |
subtask1-08.txt | AC | 2 ms | 1152 KB |
subtask1-09.txt | AC | 2 ms | 1152 KB |
subtask1-10.txt | AC | 1 ms | 1152 KB |
subtask1-11.txt | AC | 2 ms | 1152 KB |
subtask1-12.txt | AC | 2 ms | 1152 KB |
subtask1-13.txt | AC | 1 ms | 1152 KB |
subtask1-14.txt | AC | 1 ms | 1152 KB |
subtask1-15.txt | AC | 2 ms | 1152 KB |
subtask2-01.txt | AC | 2 ms | 1152 KB |
subtask2-02.txt | AC | 2 ms | 1152 KB |
subtask2-03.txt | AC | 6 ms | 1408 KB |
subtask2-04.txt | AC | 15 ms | 1920 KB |
subtask2-05.txt | AC | 18 ms | 1920 KB |
subtask2-06.txt | AC | 20 ms | 1920 KB |
subtask2-07.txt | AC | 15 ms | 1920 KB |
subtask2-08.txt | AC | 20 ms | 1920 KB |
subtask2-09.txt | AC | 20 ms | 1920 KB |
subtask2-10.txt | AC | 21 ms | 1920 KB |
subtask2-11.txt | AC | 20 ms | 1920 KB |
subtask2-12.txt | AC | 20 ms | 1920 KB |
subtask2-13.txt | AC | 21 ms | 1920 KB |
subtask2-14.txt | AC | 20 ms | 1920 KB |
subtask2-15.txt | AC | 20 ms | 1920 KB |