oj.uz

답안 #315246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315246 2020-10-22T06:18:10 Z georgerapeanu 별자리 3 (JOI20_constellation3) C++11
100 / 100
 1473 ms 77660 KB 
#include <bits/stdc++.h>

using namespace std;

const int NMAX = 2e5;

struct point_t{
    int x,y,c,id;
    bool operator < (const point_t &other)const{
        if(y != other.y){
            return y < other.y;
        }
        return id < other.id;
    }
};

class SegmentTree{
private:

    int n;
    vector<long long> aint;
    vector<long long> lazy;

    void propag(int nod,int st,int dr){
        if(st == dr || lazy[nod] == 0){
            return ;
        }

        int mid = (st + dr) / 2;

        aint[nod * 2] += 1LL * (mid - st + 1) * lazy[nod];
        aint[nod * 2 + 1] += 1LL * (dr - mid) * lazy[nod];
        lazy[nod * 2] += lazy[nod];
        lazy[nod * 2 + 1] += lazy[nod];
        lazy[nod] = 0;
    }

    void update(int nod,int st,int dr,int l,int r,long long val){
        propag(nod,st,dr);
        if(dr < l || st > r){
            return ;
        }
        if(l <= st && dr <= r){
            aint[nod] += 1LL * (dr - st + 1) * val;
            lazy[nod] += val;
            return ;
        }
        int mid = (st + dr) / 2;
        
        update(nod * 2,st,mid,l,r,val);
        update(nod * 2 + 1,mid + 1,dr,l,r,val);
        
        aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];

    }

    long long query(int nod,int st,int dr,int l,int r){
        propag(nod,st,dr);
        if(dr < l || st > r){
            return 0;
        }
        if(l <= st && dr <= r){
            return aint[nod];
        }
        int mid = (st + dr) / 2;
        return query(nod * 2,st,mid,l,r) + query(nod * 2 + 1,mid + 1,dr,l,r);
    }

public:

    SegmentTree(int n){
        this->n = n;
        aint = vector<long long>(4 * n + 5,0);
        lazy = vector<long long>(4 * n + 5,0);
    }

    void update(int l,int r,long long val){
        update(1,1,n,l,r,val);
    }

    long long query(int pos){
        long long ans = query(1,1,n,pos,pos);
        return ans;
    }
}aint(0);

int n,m;
int a[NMAX + 5];

vector<int> tree[NMAX + 5];
int jump_node[NMAX + 5];

long long dp[NMAX + 5];
int cost[NMAX + 5];

int lst = 0;
int l[NMAX + 5];
int r[NMAX + 5];


void dfs(int nod){
    l[nod] = ++lst;
    dp[nod] = 0;
    for(auto it:tree[nod]){
        dfs(it);
        dp[nod] += dp[it];
    }
    r[nod] = lst;

    for(auto it:tree[nod]){
        aint.update(l[it],r[it],dp[nod] - dp[it]);
    }
   
    aint.update(l[nod],l[nod],dp[nod]);

    dp[nod] += cost[nod];
    dp[nod] = min(dp[nod],aint.query(l[jump_node[nod]]));

    aint.update(l[nod],r[nod],cost[nod]);
}

int main(){

    scanf("%d",&n);

    vector<pair<int,int> > tmp;

    set<int> s;

    for(int i = 1;i <= n;i++){
        scanf("%d",&a[i]);
        tmp.push_back({a[i],i});
        s.insert(i);
    }

    vector<point_t> points;

    scanf("%d",&m);

    for(int i = 1;i <= m;i++){
        points.push_back({0,0,0,0});
        scanf("%d %d %d\n",&points.back().x,&points.back().y,&points.back().c);
        points.back().id = i;
        cost[i] = points.back().c;
    }

    sort(points.begin(),points.end());

    sort(tmp.begin(),tmp.end());
    reverse(tmp.begin(),tmp.end());

    s.insert(0);
    s.insert(n + 1);

    set<pair<pair<int,int>,int> > active_segments;

    set<int> untaken;

    for(int i = 0; i <= n + 1;i++){
        untaken.insert(i);
    }

    vector<int> tag(n + 1,0);

    for(auto it:points){
        while((int)tmp.size() > 0 && tmp.back().first < it.y){
            s.erase(tmp.back().second);
            tmp.pop_back();
        }
        pair<int,int> segm;
        segm.second = (*s.lower_bound(it.x)) - 1;
        segm.first = (*prev(s.lower_bound(it.x))) + 1;

        while(active_segments.empty() == false && active_segments.lower_bound({{segm.first,0},0}) != active_segments.end() && active_segments.lower_bound({{segm.first,0},0})->first.first <= segm.second){
            set<pair<pair<int,int>,int> > :: iterator it2 = active_segments.lower_bound({{segm.first,0},0});
            tree[it.id].push_back(it2->second);
            active_segments.erase(it2);
        }

        while(*untaken.lower_bound(segm.first) <= segm.second){
            tag[*untaken.lower_bound(segm.first)] = it.id;
            untaken.erase(untaken.lower_bound(segm.first));
        }

        jump_node[it.id] = tag[it.x];
        active_segments.insert({segm,it.id});
    }

    aint = SegmentTree(m);

    long long ans = 0;
    
    for(auto it:active_segments){
        dfs(it.second);
        ans += dp[it.second];
    }

    if(false){
        for(int i = 1;i <= m;i++){
            printf("nod %d %d %d %lld\n",i,jump_node[i],cost[i],dp[i]);
            for(auto it:tree[i])printf("%d ",it);
            printf("\n");
        }
    }

    printf("%lld\n",ans);

    return 0;
}

Compilation message

constellation3.cpp: In function 'int main()':
constellation3.cpp:124:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
constellation3.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  131 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~
constellation3.cpp:138:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  138 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
constellation3.cpp:142:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  142 |         scanf("%d %d %d\n",&points.back().x,&points.back().y,&points.back().c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 5 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 4 ms 5120 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5120 KB Output is correct
22 Correct 4 ms 5120 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 5 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 4 ms 5120 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5120 KB Output is correct
22 Correct 4 ms 5120 KB Output is correct
23 Correct 10 ms 5504 KB Output is correct
24 Correct 10 ms 5632 KB Output is correct
25 Correct 10 ms 5504 KB Output is correct
26 Correct 10 ms 5632 KB Output is correct
27 Correct 10 ms 5632 KB Output is correct
28 Correct 10 ms 5632 KB Output is correct
29 Correct 10 ms 5504 KB Output is correct
30 Correct 10 ms 5632 KB Output is correct
31 Correct 9 ms 5632 KB Output is correct
32 Correct 8 ms 5760 KB Output is correct
33 Correct 9 ms 5760 KB Output is correct
34 Correct 9 ms 5760 KB Output is correct
35 Correct 9 ms 5760 KB Output is correct
36 Correct 9 ms 5760 KB Output is correct
37 Correct 8 ms 5760 KB Output is correct
38 Correct 7 ms 5760 KB Output is correct
39 Correct 9 ms 5632 KB Output is correct
40 Correct 8 ms 5760 KB Output is correct
41 Correct 9 ms 5632 KB Output is correct
42 Correct 10 ms 5632 KB Output is correct
43 Correct 8 ms 5760 KB Output is correct
44 Correct 9 ms 5632 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 5 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 4 ms 5120 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5120 KB Output is correct
22 Correct 4 ms 5120 KB Output is correct
23 Correct 10 ms 5504 KB Output is correct
24 Correct 10 ms 5632 KB Output is correct
25 Correct 10 ms 5504 KB Output is correct
26 Correct 10 ms 5632 KB Output is correct
27 Correct 10 ms 5632 KB Output is correct
28 Correct 10 ms 5632 KB Output is correct
29 Correct 10 ms 5504 KB Output is correct
30 Correct 10 ms 5632 KB Output is correct
31 Correct 9 ms 5632 KB Output is correct
32 Correct 8 ms 5760 KB Output is correct
33 Correct 9 ms 5760 KB Output is correct
34 Correct 9 ms 5760 KB Output is correct
35 Correct 9 ms 5760 KB Output is correct
36 Correct 9 ms 5760 KB Output is correct
37 Correct 8 ms 5760 KB Output is correct
38 Correct 7 ms 5760 KB Output is correct
39 Correct 9 ms 5632 KB Output is correct
40 Correct 8 ms 5760 KB Output is correct
41 Correct 9 ms 5632 KB Output is correct
42 Correct 10 ms 5632 KB Output is correct
43 Correct 8 ms 5760 KB Output is correct
44 Correct 9 ms 5632 KB Output is correct
45 Correct 1468 ms 52528 KB Output is correct
46 Correct 1435 ms 51932 KB Output is correct
47 Correct 1440 ms 52512 KB Output is correct
48 Correct 1402 ms 52188 KB Output is correct
49 Correct 1426 ms 51548 KB Output is correct
50 Correct 1410 ms 51256 KB Output is correct
51 Correct 1430 ms 51748 KB Output is correct
52 Correct 1473 ms 52760 KB Output is correct
53 Correct 1433 ms 51932 KB Output is correct
54 Correct 968 ms 77660 KB Output is correct
55 Correct 937 ms 77036 KB Output is correct
56 Correct 916 ms 76376 KB Output is correct
57 Correct 944 ms 76384 KB Output is correct
58 Correct 891 ms 75360 KB Output is correct
59 Correct 883 ms 75612 KB Output is correct
60 Correct 539 ms 77276 KB Output is correct
61 Correct 986 ms 56288 KB Output is correct
62 Correct 915 ms 76384 KB Output is correct
63 Correct 993 ms 56772 KB Output is correct
64 Correct 961 ms 54236 KB Output is correct
65 Correct 777 ms 75228 KB Output is correct
66 Correct 1020 ms 58460 KB Output is correct