# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669573 | Dec0Dedd | The Kingdom of JOIOI (JOI17_joioi) | C++14 | 488 ms | 46544 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 sh short
const int N = 2e3+110;
const int INF = 1e9;
int a[N][N], cnt[N], h, w;
vector<int> v;
void fs(int &number) {
register int c;
number = 0;
c = getchar();
for (; (c>47 && c<58); c=getchar()) number = number *10 + c - 48;
}
bool cmp(sh x, sh y) {
return a[cnt[x]+1][x] > a[cnt[y]+1][y];
}
int solve() {
memset(cnt, 0, sizeof(cnt));
int res=INF, lis=INF, uis=-1;
multiset<int> js;
for (int i=1; i<=h; ++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... |