# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810340 | vjudge1 | Worst Reporter 4 (JOI21_worst_reporter4) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"
const int N = 5e3 + 9 , mod = 1e9 + 7;
ll d[N] = {} , a[N] = {}, b[N] , c[N] , us[N] = {} , p[N] = {};
vector<ll>v[N] , v1[N];
map<int,ll>map[N];
void solve(){
ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn = 1e18 , mx = 0;
cin>>n;
vector<ll>vc;
for(i = 1; i <= n; i++){
cin>>a[i]>>b[i]>>c[i];
if(i != 1)
v[a[i]].pb(i);
vc.pb(b[i]);
}
sort(rall(vc));
for(i = n; i >= 1; i--){
if(v[i].size() == 0){
for(auto to : vc)
if(to == b[i])
mp[i][to] = 0;
else
mp[i][to] = c[i];
continue;
}
for(auto to : v[i])
d[to] = 1e14;
for(auto it : vc){
s = 0;
for(auto to : v[i])
d[to] = min(d[to] , mp[to][it]) ,s += d[to];
if(it == b[i])
mp[i][it] = s ;
else
mp[i][it] = c[i] + s;
if(i == 1 && mp[i][it] < mn)
mn = mp[i][it];
}
}
cout<<mn<<"\n";
}
int main(){
TL;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
//cin>>t;
while(t--)
{
solve();
}
}
// Author : حسن