oj.uz

답안 #935184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935184 2024-02-28T19:02:30 Z velislavgarkov Worst Reporter 4 (JOI21_worst_reporter4) C++14
14 / 100
 2000 ms 140148 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'
#define getchar getchar_unlocked
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 read() {
    int res=0;
    char c=getchar();
    while (c<'0' || c>'9') c=getchar();
    while (c>='0' && c<='9') {
        res=res*10+c-'0';
        c=getchar();
    }
    return res;
}
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, par;
    n=read();
    for (int i=1;i<=n;++i) {
        par=read();
        h[i]=read();
        c[i]=read();
        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:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for (int i=0;i<v[x].size();++i) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:105:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for (int i=1;i<v[x].size();++i) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp: In function 'void find_dp(int)':
worst_reporter2.cpp:120:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i=1;i<v[x].size();++i) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:139:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |     for (int i=1;i<v[x].size();++i) {
      |                  ~^~~~~~~~~~~~
worst_reporter2.cpp:145:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for (int i=1;i<v[x].size();++i) {
      |                  ~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 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 25176 KB Output is correct
5 Correct 27 ms 28676 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 10 ms 25948 KB Output is correct
8 Correct 29 ms 28708 KB Output is correct
9 Correct 15 ms 25944 KB Output is correct
10 Correct 10 ms 25944 KB Output is correct
11 Correct 7 ms 25692 KB Output is correct
12 Correct 15 ms 28764 KB Output is correct
13 Correct 7 ms 26204 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 9 ms 25832 KB Output is correct
16 Correct 35 ms 29276 KB Output is correct
17 Correct 18 ms 26432 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 15 ms 28504 KB Output is correct
20 Correct 10 ms 25944 KB Output is correct
21 Correct 9 ms 25948 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 11 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 28508 KB Output is correct
29 Correct 14 ms 28508 KB Output is correct
30 Correct 12 ms 28504 KB Output is correct
31 Correct 14 ms 28760 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 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 25176 KB Output is correct
5 Correct 27 ms 28676 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 10 ms 25948 KB Output is correct
8 Correct 29 ms 28708 KB Output is correct
9 Correct 15 ms 25944 KB Output is correct
10 Correct 10 ms 25944 KB Output is correct
11 Correct 7 ms 25692 KB Output is correct
12 Correct 15 ms 28764 KB Output is correct
13 Correct 7 ms 26204 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 9 ms 25832 KB Output is correct
16 Correct 35 ms 29276 KB Output is correct
17 Correct 18 ms 26432 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 15 ms 28504 KB Output is correct
20 Correct 10 ms 25944 KB Output is correct
21 Correct 9 ms 25948 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 11 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 28508 KB Output is correct
29 Correct 14 ms 28508 KB Output is correct
30 Correct 12 ms 28504 KB Output is correct
31 Correct 14 ms 28760 KB Output is correct
32 Correct 27 ms 28756 KB Output is correct
33 Correct 1748 ms 118744 KB Output is correct
34 Correct 786 ms 66152 KB Output is correct
35 Correct 1678 ms 115324 KB Output is correct
36 Correct 781 ms 66100 KB Output is correct
37 Correct 230 ms 46048 KB Output is correct
38 Correct 141 ms 41300 KB Output is correct
39 Correct 496 ms 97912 KB Output is correct
40 Correct 194 ms 63168 KB Output is correct
41 Correct 81 ms 63080 KB Output is correct
42 Correct 587 ms 87592 KB Output is correct
43 Correct 189 ms 47548 KB Output is correct
44 Execution timed out 2041 ms 140148 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 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 25176 KB Output is correct
5 Correct 27 ms 28676 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 10 ms 25948 KB Output is correct
8 Correct 29 ms 28708 KB Output is correct
9 Correct 15 ms 25944 KB Output is correct
10 Correct 10 ms 25944 KB Output is correct
11 Correct 7 ms 25692 KB Output is correct
12 Correct 15 ms 28764 KB Output is correct
13 Correct 7 ms 26204 KB Output is correct
14 Correct 15 ms 28508 KB Output is correct
15 Correct 9 ms 25832 KB Output is correct
16 Correct 35 ms 29276 KB Output is correct
17 Correct 18 ms 26432 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 15 ms 28504 KB Output is correct
20 Correct 10 ms 25944 KB Output is correct
21 Correct 9 ms 25948 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 11 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 28508 KB Output is correct
29 Correct 14 ms 28508 KB Output is correct
30 Correct 12 ms 28504 KB Output is correct
31 Correct 14 ms 28760 KB Output is correct
32 Correct 27 ms 28756 KB Output is correct
33 Correct 1748 ms 118744 KB Output is correct
34 Correct 786 ms 66152 KB Output is correct
35 Correct 1678 ms 115324 KB Output is correct
36 Correct 781 ms 66100 KB Output is correct
37 Correct 230 ms 46048 KB Output is correct
38 Correct 141 ms 41300 KB Output is correct
39 Correct 496 ms 97912 KB Output is correct
40 Correct 194 ms 63168 KB Output is correct
41 Correct 81 ms 63080 KB Output is correct
42 Correct 587 ms 87592 KB Output is correct
43 Correct 189 ms 47548 KB Output is correct
44 Execution timed out 2041 ms 140148 KB Time limit exceeded
45 Halted 0 ms 0 KB -