# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444907 | aryan12 | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 2152 ms | 70712 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;
#define int long long
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2005;
int n, m;
vector<vector<int> > a(N, vector<int> (N));
int maxVal = 0, minVal = INT_MAX;
void FlipRows() {
for(int i = 1; i <= n / 2; i++) {
for(int j = 1; j <= m; j++) {
swap(a[i][j], a[n - i + 1][j]);
}
}
}
void FlipColumns() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m / 2; j++) {
swap(a[i][j], a[i][m - j + 1]);
}
}
}
bool Check(int max_delta) {
int max_row = n;
//cout << "max_delta = " << max_delta << "\n";
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |