Submission #961367

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
961367	2024-04-11 23:54:05	TAhmed33	Netrpeljivost (COI23_netrpeljivost)	C++98	59 / 100	1501 ms	79336 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, a[2049][2049];
const ll inf = 1e18;
void chmin (ll &x, ll y) {
  if (x > y) x = y;
}
vector <vector <ll>> recurse (int l, int r) {
  if (l == r - 1) {
    vector <vector <ll>> dp(2, vector <ll> (2, inf));
    dp[0][1] = dp[1][0] = a[l][r];
    return dp;
  }
  int sze = r - l + 1; 
  vector <vector <ll>> dp(sze, vector <ll> (sze, inf));
  sze >>= 1;
  int mid = (l + r) >> 1;
  auto g = recurse(l, mid), h = recurse(1 + mid, r);
  for (int i = 0; i < sze; i++) {
    for (int j = 0; j < sze; j++) {
      ll mn = inf;
      for (int k = 0; k < sze; k++) {
        chmin(mn, g[i][k] + a[k + l][j + mid + 1]);
      }
      for (int k = 0; k < sze; k++) {
        chmin(dp[i][k + sze], mn + h[k][j]);
      }
    } 
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 17 / 17
• Subtask 3: 32 / 32
• Subtask 4: 0 / 41