Submission #2116350
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define MOD 1000000007 int main(){ int R,C,K,N; cin>>R>>C>>K>>N; int r[N], c[N], nr[R]={},nc[C]={}; for(int i=0;i<N;i++){ cin>>r[i]>>c[i]; r[i]--, c[i]--; nr[r[i]]++, nc[c[i]]++; } int numr[K+1]={}, numc[K+1]={}; for(int i=0;i<R;i++){ if(nr[i]>K) continue; else numr[nr[i]]++; } for(int i=0;i<C;i++){ if(nc[i]>K) continue; else numc[nc[i]]++; } ll ans=0; for(int i=0;i<=K;i++){ ans+=1LL*numr[i]*numc[K-i]; } for(int i=0;i<N;i++){ int x=nr[r[i]]+nc[c[i]]; if(x==K){ ans--; //cout<<"- "<<r[i]<<c[i]<<endl; } else if(x==K+1){ ans++; //cout<<"+ "<<r[i]<<c[i]<<endl; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | misosoup |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 850 Byte |
Status | AC |
Exec Time | 75 ms |
Memory | 2560 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 | 3 ms | 256 KB |
subtask2-03.txt | AC | 18 ms | 512 KB |
subtask2-04.txt | AC | 55 ms | 2176 KB |
subtask2-05.txt | AC | 63 ms | 1408 KB |
subtask2-06.txt | AC | 71 ms | 1792 KB |
subtask2-07.txt | AC | 51 ms | 1024 KB |
subtask2-08.txt | AC | 71 ms | 1792 KB |
subtask2-09.txt | AC | 72 ms | 1792 KB |
subtask2-10.txt | AC | 72 ms | 1920 KB |
subtask2-11.txt | AC | 71 ms | 1792 KB |
subtask2-12.txt | AC | 72 ms | 1792 KB |
subtask2-13.txt | AC | 75 ms | 2560 KB |
subtask2-14.txt | AC | 72 ms | 1792 KB |
subtask2-15.txt | AC | 71 ms | 1792 KB |