oj.uz

Submission #935180

# Submission time Handle Problem Language Result Execution time Memory
935180 2024-02-28T18:59:02 Z velislavgarkov Worst Reporter 4 (JOI21_worst_reporter4) C++14
14 / 100
 2000 ms 138372 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_map>
using namespace std;
const int MAXN=2e5+3;
#pragma optimize ("O3")
#pragma target ("sse4")
#define endl '\n'
struct Node {
    long long mx, lazyadd, lazyset;
};
vector <int> v[MAXN];
set <int> vals[MAXN];
vector <long long> dp[MAXN];
Node tree[4*MAXN];
long long c[MAXN];
int h[MAXN], kopie[MAXN], cnt;
int ss[MAXN];
unordered_map <int,int> um;

void merge_lazy(int par, int ch) {
    if (tree[par].lazyset!=-1) {
        tree[ch].lazyset=tree[par].lazyset;
        tree[ch].lazyadd=0;
        return;
    }

    if (tree[ch].lazyset==-1) tree[ch].lazyadd+=tree[par].lazyadd;
    else tree[ch].lazyset+=tree[par].lazyadd;
}

void push_lazy(int node, int l, int r) {
    if (tree[node].lazyadd==0 && tree[node].lazyset==-1) return;

    if (tree[node].lazyadd==0) tree[node].mx=tree[node].lazyset;
    else tree[node].mx+=tree[node].lazyadd;

    if (l!=r) {
        merge_lazy(node,node*2);
        merge_lazy(node,node*2+1);
    }

    tree[node].lazyadd=0;
    tree[node].lazyset=-1;
}
void add_update(int node, int l, int r, int ql, int qr, long long ch) {
    push_lazy(node,l,r);
    if (ql>r || qr<l) return;

    if (l>=ql && r<=qr) {
        tree[node].lazyadd=ch;
        push_lazy(node,l,r);
        return;
    }

    int mid=(l+r)/2;
    add_update(node*2,l,mid,ql,qr,ch);
    add_update(node*2+1,mid+1,r,ql,qr,ch);

    tree[node].mx=max(tree[node*2].mx,tree[node*2+1].mx);
}
void set_update(int node, int l, int r, int ql, int qr, long long ch) {
    push_lazy(node,l,r);
    if (ql>r || qr<l) return;

    if (l>=ql && r<=qr) {
        tree[node].lazyset=ch;
        push_lazy(node,l,r);
        return;
    }

    int mid=(l+r)/2;
    set_update(node*2,l,mid,ql,qr,ch);
    set_update(node*2+1,mid+1,r,ql,qr,ch);

    tree[node].mx=max(tree[node*2].mx,tree[node*2+1].mx);
}
long long query(int node, int l, int r, int qind) {
    push_lazy(node,l,r);
    if (l==r) return tree[node].mx;

    int mid=(l+r)/2;
    if (qind<=mid) return query(node*2,l,mid,qind);
    return query(node*2+1,mid+1,r,qind);
}
int find_ind(int node, int l, int r, int ql, int qr, long long ch) {
    push_lazy(node,l,r);
    if (ql>r || qr<l || tree[node].mx<=ch) return -1;

    if (l==r) return l;
    int mid=(l+r)/2;
    int res=find_ind(node*2,l,mid,ql,qr,ch);
    if (res!=-1) return res;
    return find_ind(node*2+1,mid+1,r,ql,qr,ch);
}
void find_ss(int x) {
    ss[x]=1;
    for (int i=0;i<v[x].size();i++) {
        find_ss(v[x][i]);
        ss[x]+=ss[v[x][i]];
    }
    for (int i=1;i<v[x].size();i++) {
        if (ss[v[x][i]]>ss[v[x][0]]) swap(v[x][0],v[x][i]);
    }
}
void find_dp(int x) {
    if (v[x].empty()) {
        add_update(1,1,cnt,h[x]+1,cnt,c[x]);
        vals[x].insert(h[x]);
        vals[x].insert(cnt);
        return;
    }

    long long cur_res;
    int k;
    cur_res=0;
    for (int i=1;i<v[x].size();i++) {
        find_dp(v[x][i]);
        
        dp[v[x][i]].resize(vals[v[x][i]].size());
        k=0;
        for (auto j:vals[v[x][i]]) {
            dp[v[x][i]][k]=query(1,1,cnt,j);
            k++;
        }

        cur_res+=query(1,1,cnt,(*vals[v[x][i]].lower_bound(h[x])));

        set_update(1,1,cnt,1,cnt,0);
    }

    find_dp(v[x][0]);
    vals[x]=move(vals[v[x][0]]);
    cur_res+=query(1,1,cnt,(*vals[x].lower_bound(h[x])));

    for (int i=1;i<v[x].size();i++) {
        for (auto j:vals[v[x][i]]) {
            set_update(1,1,cnt,j,j, query(1,1,cnt,(*vals[x].lower_bound(j))) );
        }
    }

    for (int i=1;i<v[x].size();i++) {
        k=0;
        for (auto it=vals[v[x][i]].begin();it!=vals[v[x][i]].end();it++,k++) {
            if (k==0) add_update(1,1,cnt,1,(*it),dp[v[x][i]][k]);
            else {
                add_update(1,1,cnt,(*prev(it))+1,(*it),dp[v[x][i]][k]);
            }
            vals[x].insert((*it));
        }
    }
    add_update(1,1,cnt,1,cnt,c[x]);

    int pos=find_ind(1,1,cnt,1,h[x],cur_res);
    if (pos!=-1) {
        set_update(1,1,cnt,pos,h[x],cur_res);
    }
    
    vals[x].insert(h[x]);
}
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, par;
    cin >> n;
    for (int i=1;i<=n;i++) {
        cin >> par >> h[i] >> c[i];
        if (i!=1) v[par].push_back(i);
        kopie[i]=h[i];
    }
    sort(kopie+1,kopie+n+1);
    cnt=1;
    for (int i=1;i<=n;i++) {
        if (um[kopie[i]]==0) {
            um[kopie[i]]=cnt;
            cnt++;
        }
    }
    for (int i=1;i<=n;i++) h[i]=um[h[i]];
    find_ss(1);
    for (int j=1;j<=4*cnt;j++) {
        tree[j].lazyset=-1;
    }
    find_dp(1);
    cout << query(1,1,cnt,1) << endl;
    return 0;
}
/*
6
1 6 5
1 3 6
1 8 4
3 4 9
2 2 5
2 5 6
*/

Compilation message

worst_reporter2.cpp:8: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    8 | #pragma optimize ("O3")
      | 
worst_reporter2.cpp:9: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    9 | #pragma target ("sse4")
      | 
worst_reporter2.cpp: In function 'void find_ss(int)':
worst_reporter2.cpp:100:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for (int i=0;i<v[x].size();i++) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:104:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for (int i=1;i<v[x].size();i++) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp: In function 'void find_dp(int)':
worst_reporter2.cpp:119:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for (int i=1;i<v[x].size();i++) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:138:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |     for (int i=1;i<v[x].size();i++) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:144:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |     for (int i=1;i<v[x].size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 6 ms 25320 KB Output is correct
5 Correct 29 ms 28756 KB Output is correct
6 Correct 17 ms 25948 KB Output is correct
7 Correct 11 ms 25948 KB Output is correct
8 Correct 32 ms 28820 KB Output is correct
9 Correct 16 ms 25944 KB Output is correct
10 Correct 11 ms 25948 KB Output is correct
11 Correct 9 ms 25788 KB Output is correct
12 Correct 13 ms 28764 KB Output is correct
13 Correct 8 ms 26204 KB Output is correct
14 Correct 16 ms 28552 KB Output is correct
15 Correct 10 ms 25692 KB Output is correct
16 Correct 37 ms 29412 KB Output is correct
17 Correct 19 ms 26204 KB Output is correct
18 Correct 8 ms 25780 KB Output is correct
19 Correct 17 ms 28508 KB Output is correct
20 Correct 11 ms 25948 KB Output is correct
21 Correct 10 ms 25948 KB Output is correct
22 Correct 16 ms 28508 KB Output is correct
23 Correct 14 ms 25948 KB Output is correct
24 Correct 14 ms 28508 KB Output is correct
25 Correct 10 ms 25948 KB Output is correct
26 Correct 11 ms 28764 KB Output is correct
27 Correct 16 ms 28508 KB Output is correct
28 Correct 15 ms 28536 KB Output is correct
29 Correct 14 ms 28512 KB Output is correct
30 Correct 13 ms 28756 KB Output is correct
31 Correct 13 ms 28508 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 6 ms 25320 KB Output is correct
5 Correct 29 ms 28756 KB Output is correct
6 Correct 17 ms 25948 KB Output is correct
7 Correct 11 ms 25948 KB Output is correct
8 Correct 32 ms 28820 KB Output is correct
9 Correct 16 ms 25944 KB Output is correct
10 Correct 11 ms 25948 KB Output is correct
11 Correct 9 ms 25788 KB Output is correct
12 Correct 13 ms 28764 KB Output is correct
13 Correct 8 ms 26204 KB Output is correct
14 Correct 16 ms 28552 KB Output is correct
15 Correct 10 ms 25692 KB Output is correct
16 Correct 37 ms 29412 KB Output is correct
17 Correct 19 ms 26204 KB Output is correct
18 Correct 8 ms 25780 KB Output is correct
19 Correct 17 ms 28508 KB Output is correct
20 Correct 11 ms 25948 KB Output is correct
21 Correct 10 ms 25948 KB Output is correct
22 Correct 16 ms 28508 KB Output is correct
23 Correct 14 ms 25948 KB Output is correct
24 Correct 14 ms 28508 KB Output is correct
25 Correct 10 ms 25948 KB Output is correct
26 Correct 11 ms 28764 KB Output is correct
27 Correct 16 ms 28508 KB Output is correct
28 Correct 15 ms 28536 KB Output is correct
29 Correct 14 ms 28512 KB Output is correct
30 Correct 13 ms 28756 KB Output is correct
31 Correct 13 ms 28508 KB Output is correct
32 Correct 28 ms 28764 KB Output is correct
33 Correct 1843 ms 118796 KB Output is correct
34 Correct 802 ms 65876 KB Output is correct
35 Correct 1849 ms 115228 KB Output is correct
36 Correct 800 ms 66088 KB Output is correct
37 Correct 265 ms 45652 KB Output is correct
38 Correct 227 ms 41032 KB Output is correct
39 Correct 525 ms 97656 KB Output is correct
40 Correct 260 ms 63172 KB Output is correct
41 Correct 111 ms 62828 KB Output is correct
42 Correct 685 ms 87708 KB Output is correct
43 Correct 225 ms 47564 KB Output is correct
44 Execution timed out 2027 ms 138372 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 6 ms 25320 KB Output is correct
5 Correct 29 ms 28756 KB Output is correct
6 Correct 17 ms 25948 KB Output is correct
7 Correct 11 ms 25948 KB Output is correct
8 Correct 32 ms 28820 KB Output is correct
9 Correct 16 ms 25944 KB Output is correct
10 Correct 11 ms 25948 KB Output is correct
11 Correct 9 ms 25788 KB Output is correct
12 Correct 13 ms 28764 KB Output is correct
13 Correct 8 ms 26204 KB Output is correct
14 Correct 16 ms 28552 KB Output is correct
15 Correct 10 ms 25692 KB Output is correct
16 Correct 37 ms 29412 KB Output is correct
17 Correct 19 ms 26204 KB Output is correct
18 Correct 8 ms 25780 KB Output is correct
19 Correct 17 ms 28508 KB Output is correct
20 Correct 11 ms 25948 KB Output is correct
21 Correct 10 ms 25948 KB Output is correct
22 Correct 16 ms 28508 KB Output is correct
23 Correct 14 ms 25948 KB Output is correct
24 Correct 14 ms 28508 KB Output is correct
25 Correct 10 ms 25948 KB Output is correct
26 Correct 11 ms 28764 KB Output is correct
27 Correct 16 ms 28508 KB Output is correct
28 Correct 15 ms 28536 KB Output is correct
29 Correct 14 ms 28512 KB Output is correct
30 Correct 13 ms 28756 KB Output is correct
31 Correct 13 ms 28508 KB Output is correct
32 Correct 28 ms 28764 KB Output is correct
33 Correct 1843 ms 118796 KB Output is correct
34 Correct 802 ms 65876 KB Output is correct
35 Correct 1849 ms 115228 KB Output is correct
36 Correct 800 ms 66088 KB Output is correct
37 Correct 265 ms 45652 KB Output is correct
38 Correct 227 ms 41032 KB Output is correct
39 Correct 525 ms 97656 KB Output is correct
40 Correct 260 ms 63172 KB Output is correct
41 Correct 111 ms 62828 KB Output is correct
42 Correct 685 ms 87708 KB Output is correct
43 Correct 225 ms 47564 KB Output is correct
44 Execution timed out 2027 ms 138372 KB Time limit exceeded
45 Halted 0 ms 0 KB -