Submission #1189431

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189431		mychecksedad	Netrpeljivost (COI23_netrpeljivost)	C++20	0 / 100	1 ms	576 KiB

Main

/* Author : Mychecksdead  */
#pragma GCC optimize("unroll-loops,O3")
#pragma GCC target("avx,avx2")
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 3000+100, M = 1e5+10, K = 52, MX = 30;
const ll INF = 1e18;


int n;
ll c[N][N];
int op = 0;
ll dp[N][N], pd[N][N];
array<ll, 4> pos[N*5];
void f(int l, int r, int v){
  if(l == r){
    dp[l][l] = 0;
    pos[v] = {l, l, l, l};
    return;
  }
  int mid = l+r>>1;
  f(l, mid, v<<1);
  f(mid+1, r, v<<1|1);

  const int R0 = pos[v<<1|1][0], R1 = pos[v<<1|1][1], R2 = pos[v<<1|1][2], R3 = pos[v<<1|1][3];
  const int L0 = pos[v<<1][0], L1 = pos[v<<1][1], L2 = pos[v<<1][2], L3 = pos[v<<1][3];

  for(int x = l; x <= mid; ++x){
    for(int R = R0; R <= R1; ++R){
      for(int f = R2; f <= R3; ++f){
        pd[x][R] = min(pd[x][R], c[x][f] + dp[f][R]);
        pd[x][f] = min(pd[x][f], c[x][R] + dp[R][f]);
      }
    }
  }

  for(int x = L0; x <= L1; ++x){
    for(int y = L2; y <= L3; ++y){
      for(int X = mid + 1; X <= r; ++X){
        dp[x][X] = min(dp[x][X], dp[x][y] + pd[y][X]);
        dp[y][X] = min(dp[y][X], dp[y][x] + pd[x][X]);
      }
    }
  }
  for(int x = l; x <= mid; ++x) for(int y = mid + 1; y <= r; ++y) dp[y][x] = dp[x][y];
  pos[v] = {l, mid, mid + 1, r};
}

void solve(){
  cin >> n;
  for(int i = 1; i <= n; ++i){
    for(int j = 1; j <= n; ++j) cin >> c[i][j];
  }
  for(int i = 1; i <= n; ++i){
    for(int j = 1; j <= n; ++j) dp[i][j] = pd[i][j] = INF;
  }
  f(1, n, 1);
  ll ans = INF;
  for(int rep = 0; rep < 2; ++rep){
    for(int i = pos[1][0]; i <= pos[1][1]; ++i){
      for(int j = pos[1][2]; j <= pos[1][3]; ++j){
        ans = min(ans, dp[i][j]);
      }
    }
    swap(pos[1][0], pos[1][2]);
    swap(pos[1][1], pos[1][3]);
  }
  cout << ans << ' ' << op;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

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