Submission #3041856
Source Code Expand
#include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <deque> #include <complex> #include <stack> #include <queue> #include <cstdio> #include <cctype> #include <cstring> #include <ctime> #include <iterator> #include <bitset> #include <numeric> #include <list> #include <iomanip> using namespace std; typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pll; typedef vector<int> vint; typedef vector<vector<int> > vvint; typedef vector<long long> vll, vLL; typedef vector<vector<long long> > vvll, vvLL; #define VV(T) vector<vector< T > > template <class T> void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){ v.assign(a, vector<T>(b, t)); } template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define REP(i,n) for(int i=0;i<int(n);++i) #define ALL(v) (v).begin(),(v).end() #define RALL(v) (v).rbegin(),(v).rend() #define PB push #define MOD 1000000009LL #define EPS 1e-8 int R, C, K, N; int r[ 100010 ]; int c[ 100010 ]; int cCntR[ 100010 ]; int cCntC[ 100010 ]; int rCnt[ 100010 ]; int cCnt[ 100010 ]; int main() { cin >> R >> C >> K >> N; REP( i, N ) { cin >> r[ i ] >> c[ i ]; ++cCntR[ r[ i ] ]; ++cCntC[ c[ i ] ]; } for( int i = 1; i <= R; ++i ) { ++rCnt[ cCntR[ i ] ]; } for( int i = 1; i <= C; ++i ) { ++cCnt[ cCntC[ i ] ]; } int ans = 0; for( int i = 0; i <= K; ++i ) { ans += rCnt[ i ] * cCnt[ K - i ]; } REP( i, N ) { int tmp = cCntR[ r[ i ] ] + cCntC[ c[ i ] ]; if( tmp == K ) --ans; if( tmp == K + 1 ) ++ans; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | keitanxkeitan |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1904 Byte |
Status | WA |
Exec Time | 72 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 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 | 56 ms | 1408 KB |
subtask2-05.txt | AC | 63 ms | 1408 KB |
subtask2-06.txt | WA | 72 ms | 1792 KB |
subtask2-07.txt | AC | 55 ms | 1024 KB |
subtask2-08.txt | AC | 72 ms | 1792 KB |
subtask2-09.txt | AC | 72 ms | 1792 KB |
subtask2-10.txt | WA | 72 ms | 1792 KB |
subtask2-11.txt | WA | 72 ms | 1792 KB |
subtask2-12.txt | AC | 72 ms | 1792 KB |
subtask2-13.txt | AC | 71 ms | 1792 KB |
subtask2-14.txt | WA | 72 ms | 1792 KB |
subtask2-15.txt | AC | 71 ms | 1792 KB |