NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #213819 | #2406. Thief Masters | KXG | 100 | 1146ms | 28752kb | C++11 | 2.9kb | 2024-11-13 20:27:06 | 2024-11-13 23:06:31 |
answer
#include <cstdio>
#include <queue>
using namespace std;
struct solvemax {
int n, m, k;
int a[1010][1010];
int tmp[1010][1010], res[1010][1010];
deque<int> dq;
void init() {
for (int i = 1; i <= n; i++) {
while (!dq.empty()) dq.pop_back();
for (int j = 1; j <= m; j++) {
while (!dq.empty() && a[i][dq.back()] < a[i][j]) {
dq.pop_back();
}
while (!dq.empty() && dq.front() <= j - k) {
dq.pop_front();
}
dq.push_back(j);
tmp[i][j] = a[i][dq.front()];
}
}
for (int j = 1; j <= m; j++) {
while (!dq.empty()) dq.pop_back();
for (int i = 1; i <= n; i++) {
while (!dq.empty() && tmp[dq.back()][j] < tmp[i][j]) {
dq.pop_back();
}
while (!dq.empty() && dq.front() <= i - k) {
dq.pop_front();
}
dq.push_back(i);
res[i][j] = tmp[dq.front()][j];
}
}
}
} smax;
struct solvemin {
int n, m, k;
int a[1010][1010];
int tmp[1010][1010], res[1010][1010];
deque<int> dq;
void init() {
for (int i = 1; i <= n; i++) {
while (!dq.empty()) dq.pop_back();
for (int j = 1; j <= m; j++) {
while (!dq.empty() && a[i][dq.back()] > a[i][j]) {
dq.pop_back();
}
while (!dq.empty() && dq.front() <= j - k) {
dq.pop_front();
}
dq.push_back(j);
tmp[i][j] = a[i][dq.front()];
}
}
for (int j = 1; j <= m; j++) {
while (!dq.empty()) dq.pop_back();
for (int i = 1; i <= n; i++) {
while (!dq.empty() && tmp[dq.back()][j] > tmp[i][j]) {
dq.pop_back();
}
while (!dq.empty() && dq.front() <= i - k) {
dq.pop_front();
}
dq.push_back(i);
res[i][j] = tmp[dq.front()][j];
}
}
}
} smin;
int n, m, k;
int a[1010][1010];
int main() {
scanf("%d%d%d", &n, &m, &k);
smax.n = smin.n = n;
smax.m = smin.m = m;
smax.k = smin.k = k;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
smax.a[i][j] = a[i][j];
smin.a[i][j] = a[i][j];
}
}
smax.init();
smin.init();
int ans = 1e9;
for (int i = k; i <= n; i++) {
for (int j = k; j <= m; j++) {
// printf("%d %d : %d %d\n", i, j, smax.res[i][j], smin.res[i][j]);
ans = min(ans, smax.res[i][j] - smin.res[i][j]);
}
}
printf("%d\n", ans);
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 163ms
memory: 28748kb
input:
1000 1000 100 804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...
output:
998893495
result:
ok single line: '998893495'
Test #2:
score: 10
Accepted
time: 1ms
memory: 1228kb
input:
5 4 2 1 2 5 6 0 17 16 0 16 17 0 1 2 10 2 1 1 2 3 2
output:
2
result:
ok single line: '2'
Test #3:
score: 10
Accepted
time: 0ms
memory: 3860kb
input:
100 100 10 2 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 1200001 ...
output:
908999
result:
ok single line: '908999'
Test #4:
score: 10
Accepted
time: 259ms
memory: 28748kb
input:
1000 1000 20 1 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 120000...
output:
1901899
result:
ok single line: '1901899'
Test #5:
score: 10
Accepted
time: 77ms
memory: 14924kb
input:
500 500 50 79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...
output:
995944328
result:
ok single line: '995944328'
Test #6:
score: 10
Accepted
time: 151ms
memory: 14936kb
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
998299092
result:
ok single line: '998299092'
Test #7:
score: 10
Accepted
time: 225ms
memory: 28752kb
input:
1000 1000 80 102 134 429 251 299 109 264 669 727 296 112 550 270 270 544 660 131 546 968 219 113 678...
output:
998
result:
ok single line: '998'
Test #8:
score: 10
Accepted
time: 41ms
memory: 14920kb
input:
500 500 100 65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...
output:
999172505
result:
ok single line: '999172505'
Test #9:
score: 10
Accepted
time: 64ms
memory: 14940kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
Test #10:
score: 10
Accepted
time: 165ms
memory: 28748kb
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
output:
998862873
result:
ok single line: '998862873'
Extra Test:
score: 0
Extra Test Passed
