# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061149 | NeroZein | Netrpeljivost (COI23_netrpeljivost) | C++17 | 1523 ms | 155868 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;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
const int N = 2050;
const long long INF = 1e15;
int a[N][N];
long long dp[N][N];
long long ndp[N][N];
long long dp2[N][N];
void solve(int l, int r) {
if (l + 1 == r) {
dp[l][r] = dp[r][l] = a[l][r];
return;
}
int mid = (l + r) / 2;
solve(l, mid);
solve(mid + 1, r);
for (int i = l; i <= r; ++i) {
for (int j = l; j <= r; ++j) {
ndp[i][j] = ndp[j][i] = INF;
dp2[i][j] = dp2[j][i] = INF;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |