#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
int N, M, K, B, Z;
vector<vector<int> > dist;
bool inRange(int i, int j){
return 0 <= i && i < N && 0 <= j && j < M;
}
int cnt[2000003];
int main() {
cin >> N >> M >> K >> B >> Z;
dist = vector<vector<int> >(N, vector<int>(M, -1));
queue<pair<int,int> > q;
for(int i = 0 ; i < K; i++){
int r,c;
cin >> r >> c;
r--, c--;
q.push({r, c});
dist[r][c] = 0;
}
int maxD = 0;
while(!q.empty()){
auto p = q.front();
q.pop();
int ci = p.first;
int cj = p.second;
for(int k = 0 ; k < 4; k++){
int ni = ci + "1021"[k] - '1';
int nj = cj + "0112"[k] - '1';
if(!inRange(ni, nj) || dist[ni][nj] != -1) continue;
dist[ni][nj] = dist[ci][cj] + 1;
cnt[dist[ni][nj]]++;
maxD = max(maxD, dist[ni][nj]);
q.push({ni, nj});
}
}
int ans1 = 0;
int t = 0;
int cur = Z;
for(int i = maxD; i > t;) {
if(cnt[i] > cur){
cnt[i] -= cur;
ans1 += cur;
cur = Z;
t++;
}
else {
cur -= cnt[i];
ans1 += cnt[i];
i--;
}
}
cout << ans1 << endl;
int ans2 = 0;
for(int i = 1; i <= maxD; i++) ans2 += min(cnt[i], Z);
cout << ans2 << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
9836 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
9836 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
