# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396949 | timmyfeng | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 731 ms | 44144 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;
const int N = 2001;
int prefix[N], suffix[N], diff[N][N], a[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
int maxi = INT_MIN, mini = INT_MAX;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
maxi = max(maxi, a[i][j]);
mini = min(mini, a[i][j]);
}
}
fill(diff[0], diff[0] + m + 1, INT_MIN);
int ans = INT_MAX;
for (int k = 0; k < 2; ++k) {
for (int i = 0; i < n; ++i) {
reverse(a[i], a[i] + m);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |