Submission #1189455

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189455		mychecksedad	Nestabilnost (COI23_nestabilnost)	C++20	12 / 100	175 ms	200968 KiB

code1

/* Author : Mychecksdead  */
#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 = 5000+100, M = 1e5+10, K = 52, MX = 30;
const ll INF = 1e18;

int n;
ll a[N], f[N], dp[N][N], DP[N];
vi g[N];
void dfs(int v, int p){
  for(int k = 1; k <= n; ++k){
    if(k <= a[v]) dp[v][k] = INF;
    else dp[v][k] = f[k];
  }
  for(int u: g[v]){
    if(u != p){
      dfs(u, v);
      for(int k = 1; k <= n; ++k){
        if(a[u] == (a[v] + 1) % k){
          dp[v][k] += dp[u][k] - f[k];
        }else{
          dp[v][k] += DP[u];
        }
        dp[v][k] = min(dp[v][k], INF);
      }
    }
  }
  DP[v] = INF;
  for(int i = 1; i <= n; ++i){
    DP[v] = min(DP[v], dp[v][i]);
  }
}

void solve(){
  cin >> n;
  for(int i = 1; i <= n; ++i){
    cin >> a[i];
  }
  for(int i = 1; i <= n; ++i){
    cin >> f[i];
  }
  for(int i = 1; i < n; ++i){
    int u, v; cin >> u >> v;
    g[u].pb(v);
    g[v].pb(u);
  }
  dfs(1, 1);
  cout << DP[1];
}
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: 12 / 12
• Subtask 2: 0 / 20
• Subtask 3: 0 / 7
• Subtask 4: 0 / 22
• Subtask 5: 0 / 39