Submission #1060085

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1060085	2024-08-15 10:32:20	aymanrs	Nestabilnost (COI23_nestabilnost)	C++17	41 / 100	455 ms	524288 KiB

code1

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;
vector<int> cost;int N;
struct node {
    vector<long long> dp;
    long long free;
    vector<node*> l;
    int a;
};
void dfs(node* n, node* p){
    for(node* c : n->l) if(c!=p) dfs(c,n);
    n->dp.resize(N+1);
    n->free = LONG_LONG_MAX;
    for(int k = n->a+1;k <= N;k++){
        n->dp[k] = cost[k];
        for(node* c : n->l){
            if(c==p) continue;
            if(!c->a){
                if(k == n->a+1) n->dp[k] += min(c->dp[k]-cost[k], c->free);
                else n->dp[k] += c->free;
            } else if(c->a == n->a+1){
                if(k>c->a) n->dp[k] += min(c->dp[k]-cost[k], c->free);
                else n->dp[k] += c->free;
            } else n->dp[k] += c->free;
        }
        n->free = min(n->free, n->dp[k]);
    }
}
void solve(){
    int n;cin >> n;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 0 / 20
• Subtask 3: 7 / 7
• Subtask 4: 22 / 22
• Subtask 5: 0 / 39