# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109366 | mariaclara | The Kingdom of JOIOI (JOI17_joioi) | C++17 | 1472 ms | 70612 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;
typedef long long ll;
typedef tuple<ll,ll,ll> trio;
typedef pair<int,int> pii;
const int MAXN = 2e5+5;
const ll INF = 1e9;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
int n, m, max_val, min_val = 1e9, v[2005][2005], color[2005][2005];
bool check(int dif) {
for(int i = 1; i <= n; i++) {
for(int j = 1, a, b, c, d; j <= m; j++) {
color[i][j] = 0;
if(max_val - dif >= v[i][j]) color[i][j] = 1, a = i, b = j;
if(min_val + dif <= v[i][j]) color[i][j] = -1, c = i, d = j;
if(a == c and b == d) return 0;
}
}
bool c_pos = 1, d_pos = 1, c_neg = 1, d_neg = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |