# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292633 | 2020-09-07T11:13:16 Z | 반딧불(#5810) | Robogolf (ROI19_golf) | C++17 | 99 ms | 16384 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MOD = 998244353; int n, m, k; int MIN[1002][1002]; int MAX[1002][1002]; bool chk[1002][1002]; ll ans; int main(){ scanf("%d %d %d", &n, &m, &k); for(int i=1; i<=n; i++){ for(int j=1; j<=m; j++){ MIN[i][j] = INT_MAX; MAX[i][j] = INT_MIN; } } for(int i=1; i<=k; i++){ int x, y, z; scanf("%d %d %d", &x, &y, &z); if(chk[x][y]) return 1; MIN[x][y] = MAX[x][y] = z; chk[x][y] = 1; } for(int i=n; i>=1; i--){ for(int j=m; j>=1; j--){ if(!chk[i][j]){ MIN[i][j] = min(MAX[i+1][j], MAX[i][j+1]); MAX[i][j] = max(MIN[i+1][j], MIN[i][j+1]); } ans += MIN[i][j]; if(ans < 0) ans += MOD; } } ans %= MOD; printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Incorrect | 0 ms | 384 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Runtime error | 1 ms | 512 KB | Execution failed because the return code was nonzero |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 1280 KB | Output is correct |
2 | Runtime error | 16 ms | 16372 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Incorrect | 0 ms | 384 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 99 ms | 16384 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 99 ms | 16384 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Incorrect | 0 ms | 384 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 15 ms | 16384 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Incorrect | 0 ms | 384 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |