# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595059 | piOOE | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 3366 ms | 58712 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2001;
int a[N][N], n, m, mx, px, py;
bool t[N][N];
void upd() {
mx = -1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (mx < a[i][j]) {
mx = a[i][j];
px = i, py = j;
}
}
}
}
void mirror() {
for (int i = 0; i < n; ++i) {
reverse(a[i], a[i] + m);
}
upd();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |