Submission #796319

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
796319	2023-07-28 09:25:53	Dan4Life	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	14 / 100	418 ms	399948 KiB

worst_reporter2

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;
#define pb push_back
#define int long long
#define all(a) begin(a),end(a)
const int mxN = (int)5e3+10;
const int LINF = (int)2e18;
int n, dp[mxN][mxN];
int a[mxN], h[mxN], c[mxN];
vector<int> adj[mxN];
int recur(int s, int v){
  if(v>=5001) return LINF;
  if(dp[s][v]!=-1) return dp[s][v];
  int ans = (v!=h[s])*c[s];
  for(auto u : adj[s]) ans+=recur(u,v);
  ans = min(ans, recur(s,v+1));
  return dp[s][v]=ans;
}
int32_t main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> n; vector<int> v;
  memset(dp,-1,sizeof(dp));
  for(int i = 1; i <= n; i++){
    cin >> a[i] >> h[i] >> c[i];
    if(i>1) adj[a[i]].pb(i);
    v.pb(h[i]);
  }
  sort(all(v)); v.erase(unique(all(v)),end(v));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 65
• Subtask 3: 0 / 21