NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #211064 | #3801. Thief Masters | FHL | 20 | 0ms | 2144kb | C++11 | 5.3kb | 2024-08-09 10:02:30 | 2024-08-09 12:41:36 |
answer
#include <cstdio>
#include <algorithm>
#pragma GCC optimize(2)
using namespace std;
#ifdef ONLINE_JUDGE
#define getchar getchar_unlocked
#endif
namespace FastIO {
char write_cache[40];
template <class T>
inline const T read() noexcept
{
T x(0);
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
f ^= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
template <class T>
inline const void read(T &x) noexcept
{
x = 0;
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
f ^= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
x = f ? -x : x;
}
template <class T, class... P>
inline const void read(T &x, P &...ark) noexcept
{
x = 0;
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
f ^= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
x = f ? -x : x;
read(ark...);
}
template <class T>
inline const void readu(T &x) noexcept
{
x = 0;
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
}
template <class T>
inline const T readu() noexcept
{
T x(0);
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return x;
}
template <class T, class... P>
inline const void readu(T &x, P &...ark) noexcept
{
x = 0;
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
readu(ark...);
}
template <class T>
inline const void readArr(T *begin, T *end) noexcept
{
while (begin < end)
{
*begin = 0;
char ch(getchar());
bool f(0);
while (ch < '0' || ch > '9')
f ^= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
*begin = (*begin << 1) + (*begin << 3) + (ch ^ 48), ch = getchar();
*begin = f ? -*begin : *begin;
}
}
template <class T>
inline const void readArr(T *begin, int cnt) noexcept
{
while (cnt--)
{
read(*begin);
++begin;
}
}
template <class T>
inline const void write(T x) noexcept
{
if (x < 0)
putchar('-'), x = -x;
int cnt = 0;
while (x)
write_cache[cnt++] = x % 10 ^ 48, x /= 10;
if (!cnt)
putchar('0');
else
while (cnt--)
putchar(write_cache[cnt]);
}
template <char end = ' ', class T, class... ARK>
inline const void write(T &x, ARK &...ark) noexcept
{
write(x);
putchar(end);
write(ark...);
}
template <char end = '\n', class T>
inline const void println(T x) noexcept
{
if (x < 0)
putchar('-'), x = -x;
int cnt = 0;
while (x)
write_cache[cnt++] = x % 10 ^ 48, x /= 10;
if (!cnt)
putchar('0');
else
while (cnt--)
putchar(write_cache[cnt]);
putchar(end);
}
template <char sep = ' ', char endl = '\n', class T>
inline const void writeArr(T *begin, T *end) noexcept
{
while (begin < end)
write(*begin), putchar(sep), ++begin;
putchar(endl);
}
template <char sep = ' ', char end = '\n', class T>
inline const void writeArr(T *arr, int cnt)
{
while (cnt--)
{
write(*arr);
putchar(sep);
++arr;
}
putchar(end);
}
}
using namespace FastIO;
inline int _max(int x, int y) {
return (x > y) ? x : y;
}
inline int _min(int x, int y) {
return (x < y) ? x : y;
}
const int N = 1005, INF = 1e9 + 7;
int a, b, n, g[N][N], ans = INF, f1[N][N], f2[N][N];
int main() {
read(a, b, n);
for (register int i = 0; i < a; ++ i )
for (register int j = 0; j < b; ++ j ) {
read(g[i][j]);
f1[i][j] = g[i][j];
f2[i][j] = g[i][j];
}
for (register int k = 0; k < n - 1; ++ k )
for (register int i = 0; i < a - 1; ++ i )
for (register int j = 0; j < b - 1; ++ j ) {
f1[i][j] = _max(g[i][j], _max(f1[i + 1][j + 1], _max(f1[i + 1][j], f1[i][j + 1])));
f2[i][j] = _min(g[i][j], _min(f2[i + 1][j + 1], _min(f2[i + 1][j], f2[i][j + 1])));
}
for (register int i = 0; i <= a - n; i ++ )
for (register int j = 0; j <= b - n; j ++ )
ans = _min(ans, f1[i][j] - f2[i][j]);
println(ans);
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 0
Runtime Error
input:
5000 5000 1000 112860841 963292630 950228017 843100821 628111020 568250408 901169419 322571542 98853...
output:
result:
Test #2:
score: 10
Accepted
time: 0ms
memory: 1020kb
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: 2144kb
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: 0
Runtime Error
input:
5000 5000 1000 8974 8293 3530 8179 6181 2983 6500 3525 2603 1983 6720 5938 9247 2494 4568 9909 3852 ...
output:
result:
Test #5:
score: 0
Runtime Error
input:
5000 5000 1000 3206 5640 1070 5846 5931 3274 6116 1741 543 6399 1626 115 92 3037 464 100 3700 2694 5...
output:
result:
Test #6:
score: 0
Runtime Error
input:
5000 5000 1000 9041 1397 3723 7115 4298 5210 8033 5608 6711 6539 7140 5331 4282 2599 59 9363 5817 25...
output:
result:
Test #7:
score: 0
Runtime Error
input:
5000 5000 1000 19636 14616 3910 15971 9484 16390 2221 13667 5771 1364 2375 15202 16870 7107 13189 16...
output:
result:
Test #8:
score: 0
Runtime Error
input:
5000 5000 1000 3628 1018 3668 18160 14975 18599 9087 10641 19468 16400 19072 16984 6583 7925 19853 1...
