# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810606 | rainboy | Netrpeljivost (COI23_netrpeljivost) | C11 | 861 ms | 95400 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 <stdio.h>
#include <string.h>
#define N 2048
#define INF 0x3f3f3f3f3f3f3f3fLL
long long min(long long a, long long b) { return a < b ? a : b; }
int main() {
static int ww[N][N];
static long long dp[N][N], dq[N][N], xx[N];
int n, h, i, j, k, l, m, r, lm, mr;
long long ans;
scanf("%d", &n);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
scanf("%d", &ww[i][j]);
if (n == 1) {
printf("0\n");
return 0;
}
if (n == 2) {
printf("%d\n", ww[0][1]);
return 0;
}
for (h = 0; 1 << h < n / 2; h++)
if (h == 0)
for (i = 0; i < n; i += 2) {
j = i + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |