Submission #589684

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
589684	2022-07-05 06:24:31	Peti	Worst Reporter 4 (JOI21_worst_reporter4)	C++14	79 / 100	446 ms	524288 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;
vector<vector<int>> g;
vector<int> h, ert;
vector<map<int, long long>> mps;
void bejar(int akt){
    for(int x : g[akt]){
        bejar(x);
        if(mps[x].size() > mps[akt].size()) swap(mps[akt], mps[x]);
        for(auto p : mps[x]) mps[akt][p.first] += p.second;
    }
    auto it = mps[akt].find(h[akt]);
    if(it == mps[akt].end()){
        mps[akt][h[akt]] = ert[akt];
        it = mps[akt].find(h[akt]);
    } else{
        mps[akt][h[akt]] += ert[akt];
    }
    long long tmp = ert[akt];
    while(it != mps[akt].begin() && prev(it)->second < tmp){
        tmp -= prev(it)->second;
        mps[akt].erase(prev(it));
    }
    if(it != mps[akt].begin()) prev(it)->second -= tmp;
}
int main(){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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