제출 #954492

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
954492	2024-03-28 04:27:13	Skywk	Magic Tree (CEOI19_magictree)	C++17	100 / 100	102 ms	38484 KiB

magictree

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;
const int MAXN = 1e5;
struct Tree{
    vector<int> adj[MAXN + 1];
    int ds[MAXN + 1], js[MAXN + 1];
    void insert(map<int, long long>* dp, int v){
        (*dp)[ds[v]] += js[v];
        auto ptr = dp->find(ds[v]);
        int j_left = js[v];
        while(j_left > 0 && next(ptr) != dp->end()){
            auto nxt_ptr = next(ptr);
            if(nxt_ptr->second > j_left){
                nxt_ptr->second -= j_left;
                break;
            }
            else{
                j_left -= nxt_ptr->second;
                dp->erase(nxt_ptr);
            }
        }
    }
    map<int, long long>* TreeDp(int v){
        auto curr_map = new map<int, long long>();
        for(auto u : adj[v]){
            auto new_map = TreeDp(u);
            if(new_map->size() > curr_map->size()) swap(curr_map, new_map);
            for(auto [key, value] : *new_map){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17