Submission #1161778

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1161778	2025-03-05 06:12:12	Math4Life2020	Constellation 3 (JOI20_constellation3)	C++20	100 / 100	252 ms	52120 KiB

constellation3

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;
using ll = long long; using pii = pair<ll,ll>;
const ll Nm = 2e5+5; const ll INF = 1e18;
struct Node {
    ll cht = 0;
    ll lzadd = 0; //lazy add tag
    ll vnh = 0; //value at no height
    map<ll,ll> mht; //map: height -> value, must be strictly increasing
    Node(){}
    void print() {
        return;
        cout << "cht="<<cht<<", lzadd="<<lzadd<<", vnh="<<vnh<<"\n";
        cout << "mht: \n";
        for (pii p0: mht) {
            cout << "term: "<<p0.first<<" "<<p0.second<<"\n";
        }
    }
    Node(ll _cht, vector<pii> velem) {
        cht = _cht;
        sort(velem.begin(),velem.end());
        ll cmax = 0;
        for (pii p0: velem) {
            if (p0.second>cmax) {
                mht[p0.first]=p0.second;
                cmax = p0.second;
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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