# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87903 | tieunhi | The Kingdom of JOIOI (JOI17_joioi) | C++14 | 2285 ms | 53992 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>
#define pii pair<ll, ll>
#define mp make_pair
#define F first
#define S second
#define PB push_back
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define ll long long
#define N 2003
#define LN 19
#define maxc 1000000007
using namespace std;
int n, m, a[N][N], amin, amax, pos[N];
bool b[N][N];
void revRow()
{
FOR(i, 1, n)
FOR(j, 1, m/2)
swap(a[i][j], a[i][m-j+1]);
}
void revCol()
{
FOR(j, 1, m)
FOR(i, 1, n/2)
swap(a[i][j], a[n-i+1][j]);
}
bool ok(int diff)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |