Submission #953153

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
953153	2024-03-25 14:55:34	Unforgettablepl	Fireworks (APIO16_fireworks)	C++17	55 / 100	2052 ms	106280 KiB

fireworks

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>
#include <utility>
using namespace std;
#define int long long
struct line{
    int m,n;
    vector<int> points;
    line(int m,int n,vector<int> points):m(m),n(n),points(points){}
    void operator+=(const line &other){
        m+=other.m;
        n+=other.n;
        vector<int> newpoints(points.size()+other.points.size());
        merge(points.begin(), points.end(),other.points.begin(), other.points.end(),newpoints.begin());
        points = newpoints;
    }
};
int n,m;
vector<pair<int,int>> adj[300001];
line dfs(int x,int p){
    if(x>n)return {1,-adj[x][0].second,{adj[x][0].second,adj[x][0].second}};
    int len = 0;
    line curr(0,0,{});
    for(auto&i:adj[x]){
        if(i.first!=p)curr+=dfs(i.first,x);
        else len = i.second;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 19 / 19
• Subtask 3: 29 / 29
• Subtask 4: 0 / 45