# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415037 | nvmdava | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 757 ms | 54920 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 ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 100005;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int SQ = 300;
int n, m;
int mn = 1'000'000'000, mx = 0;
int a[2005][2005];
void flipx(){
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m / 2; ++j)
swap(a[i][j], a[i][m + 1 - j]);
}
void flipy(){
for(int i = 1; i <= n / 2; ++i)
for(int j = 1; j <= m; ++j)
swap(a[i][j], a[n + 1 - i][j]);
}
bool check(int x){
int lim = m;
for(int i = 1; i <= n; ++i){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |