Submission #2215958
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,m) for(long long i=0; i<m; i++) #define FOR(i,n,m) for(long long i=n; i<m; i++) #define INF 1000000000 #define INFL 10000000000000000LL #define pb push_back #define ll long long int #define P pair<ll, ll> int main() { int r, c, k; cin >> r >> c >> k; int n; int R[r] = { }, C[c] = { }; map<P, int> m; cin >> n; REP(i, n){ int x, y; cin >> x >> y; x--; y--; R[x]++; C[y]++; m[{x, y}]++; } map<int, vector<int>> mr, mc; REP(i, r) mr[R[i]].pb(i); REP(i, c) mc[C[i]].pb(i); ll ans = 0; REP(i, k+1){ if(mr[i].size()){ if(mc[k-i].size()){ for(int x: mr[i]){ for(int y: mc[k-i]){ if(m[{x, y}] == 0) ans++; } } } if(mc[k-i+1].size()){ for(int x: mr[i]){ for(int y: mc[k-i+1]){ if(m[{x, y}] == 1) ans++; } } } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | EctoPlasma |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1042 Byte |
Status | TLE |
Exec Time | 2148 ms |
Memory | 755628 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 | 384 KB |
subtask2-02.txt | AC | 4 ms | 768 KB |
subtask2-03.txt | AC | 24 ms | 2176 KB |
subtask2-04.txt | AC | 126 ms | 15100 KB |
subtask2-05.txt | AC | 92 ms | 7676 KB |
subtask2-06.txt | TLE | 2124 ms | 340860 KB |
subtask2-07.txt | AC | 80 ms | 6528 KB |
subtask2-08.txt | TLE | 2131 ms | 452168 KB |
subtask2-09.txt | TLE | 2142 ms | 659228 KB |
subtask2-10.txt | TLE | 2122 ms | 309088 KB |
subtask2-11.txt | TLE | 2120 ms | 282908 KB |
subtask2-12.txt | TLE | 2144 ms | 672124 KB |
subtask2-13.txt | AC | 124 ms | 15992 KB |
subtask2-14.txt | TLE | 2123 ms | 326904 KB |
subtask2-15.txt | TLE | 2148 ms | 755628 KB |