oj.uz

Submission #586235

# Submission time Handle Problem Language Result Execution time Memory
586235 2022-06-30T05:21:34 Z abcvuitunggio Team Contest (JOI22_team) C++17
73 / 100
 1945 ms 117044 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using std::cin;
using std::cout;
using std::vector;
using std::map;
using std::pair;
using std::max;
using std::sort;
using std::make_pair;
using std::ios_base;
const int mn=-1000000000;
struct point{
    int x,y,val;
}p[150001][2];
int ft[150001][2],n,x[150001],y[150001],z[150001],id[3],val[150001][3],res=-1,szx,szy,idx[150001];
vector <int> v[3],node[150001],bit[150001];
map <int, int> mp[3];
vector <pair <int, point> > pending;
vector <pair <pair <int, int>, int> > f;
inline void update(int x, int val, int idx){
    for (;x<=max(szx,szy);x+=x&(-x))
        ft[x][idx]=max(ft[x][idx],val);
}
inline int get(int i, int idx){
    int res=0;
    for (;i;i-=i&(-i))
        res=max(res,ft[i][idx]);
    return res;
}
inline void fakeUpdate(int x, int y){
    for (;x<=szx;x+=x&-x)
        node[x].push_back(y);
}
inline void fakeGet(int x, int y){
    for (;x;x-=x&-x)
        node[x].push_back(y);
}
inline void update2D(int x, int yy, int val) {
    for (;x<=szx;x+=x&-x)
        for (int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y){
            if (bit[x][y-1]>val)
                break;
            bit[x][y-1]=val;
        }
}
inline int get2D(int x, int yy){
    int res=mn;
    for (;x;x-=x&-x)
        for (int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y;y-=y&-y)
            res=max(res,bit[x][y-1]);
    return res;
}
inline bool cmp(int i, int j){
    return x[i]<x[j];
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n;
    for (int i=0;i<n;i++){
        cin >> x[i] >> y[i] >> z[i];
        v[0].push_back(x[i]);
        v[1].push_back(y[i]);
        v[2].push_back(z[i]);
        idx[i]=i;
    }
    sort(idx,idx+n,cmp);
    for (int i=0;i<3;i++){
        sort(v[i].begin(),v[i].end());
        for (int j:v[i])
            if (!mp[i].count(j)){
                mp[i][j]=++id[i];
                val[id[i]][i]=j;
            }
    }
    for (int i=0;i<n;i++){
        x[i]=mp[0][x[i]];
        y[i]=mp[1][y[i]];
        z[i]=mp[2][z[i]];
        szx=max(szx,y[i]+1);
        szy=max(szy,z[i]+1);
    }
    for (int r=0;r<n;r++){
        int i=idx[r];
        p[i][0].x=y[i];
        int mx=get(y[i]-1,0);
        if (mx>z[i]){
            p[i][0].y=mx;
            p[i][0].val=val[y[i]][1]+val[mx][2];
        }
        p[i][1].y=z[i];
        mx=get(z[i]-1,1);
        if (mx>y[i]){
            p[i][1].x=mx;
            p[i][1].val=val[mx][1]+val[z[i]][2];
        }
        update(y[i],z[i],0);
        update(z[i],y[i],1);
    }
    for (int i=0;i<n;i++){
        p[i][0].x=szx-p[i][0].x;
        p[i][0].y=szy-p[i][0].y;
        p[i][1].x=szx-p[i][1].x;
        p[i][1].y=szy-p[i][1].y;
        y[i]=szx-y[i];
        z[i]=szy-z[i];
        if (p[i][0].y!=szy)
            f.push_back(make_pair(make_pair(p[i][0].y,p[i][0].x),0));
        if (p[i][1].x!=szx)
            f.push_back(make_pair(make_pair(p[i][1].y,p[i][1].x),0));
        f.push_back(make_pair(make_pair(z[i]-1,y[i]-1),1));
    }
    sort(f.begin(),f.end());
    for (auto i:f)
        if (i.second)
            fakeGet(i.first.second,i.first.first);
        else
            fakeUpdate(i.first.second,i.first.first);
    for (int i=1;i<=szx;i++)
        bit[i].resize(node[i].size(),mn);
    for (int r=0;r<n;r++){
        int i=idx[r];
        if (!pending.empty()){
            if (x[i]>pending.back().first)
                while (!pending.empty()){
                    update2D(pending.back().second.x,pending.back().second.y,pending.back().second.val);
                    pending.pop_back();
                }
        }
        if (p[i][0].y!=szy)
            pending.push_back(make_pair(x[i],p[i][0]));
        if (p[i][1].x!=szx)
            pending.push_back(make_pair(x[i],p[i][1]));
        res=max(res,val[x[i]][0]+get2D(y[i]-1,z[i]-1));
    }
    cout << res;
}

Compilation message

team.cpp: In function 'void update2D(int, int, int)':
team.cpp:45:85: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y){
      |                                                                                    ~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7408 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7404 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 5 ms 7476 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 5 ms 7432 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7408 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7404 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 5 ms 7476 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 5 ms 7432 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 20 ms 9292 KB Output is correct
27 Correct 16 ms 8724 KB Output is correct
28 Correct 15 ms 8596 KB Output is correct
29 Correct 13 ms 8248 KB Output is correct
30 Correct 11 ms 8148 KB Output is correct
31 Correct 17 ms 8472 KB Output is correct
32 Correct 10 ms 8100 KB Output is correct
33 Correct 8 ms 8148 KB Output is correct
34 Correct 12 ms 8660 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 5 ms 7508 KB Output is correct
37 Correct 8 ms 8044 KB Output is correct
38 Correct 9 ms 8020 KB Output is correct
39 Correct 7 ms 7692 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 173 ms 26200 KB Output is correct
12 Correct 97 ms 17304 KB Output is correct
13 Correct 86 ms 17056 KB Output is correct
14 Correct 165 ms 24084 KB Output is correct
15 Correct 115 ms 23276 KB Output is correct
16 Correct 91 ms 18792 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 173 ms 26200 KB Output is correct
12 Correct 97 ms 17304 KB Output is correct
13 Correct 86 ms 17056 KB Output is correct
14 Correct 165 ms 24084 KB Output is correct
15 Correct 115 ms 23276 KB Output is correct
16 Correct 91 ms 18792 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 8 ms 7664 KB Output is correct
22 Correct 299 ms 31836 KB Output is correct
23 Correct 210 ms 27524 KB Output is correct
24 Correct 147 ms 21152 KB Output is correct
25 Correct 197 ms 25436 KB Output is correct
26 Correct 113 ms 24020 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 173 ms 26200 KB Output is correct
12 Correct 97 ms 17304 KB Output is correct
13 Correct 86 ms 17056 KB Output is correct
14 Correct 165 ms 24084 KB Output is correct
15 Correct 115 ms 23276 KB Output is correct
16 Correct 91 ms 18792 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 8 ms 7664 KB Output is correct
22 Correct 299 ms 31836 KB Output is correct
23 Correct 210 ms 27524 KB Output is correct
24 Correct 147 ms 21152 KB Output is correct
25 Correct 197 ms 25436 KB Output is correct
26 Correct 113 ms 24020 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 5 ms 7424 KB Output is correct
30 Correct 5 ms 7380 KB Output is correct
31 Correct 11 ms 8020 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct
33 Correct 5 ms 7536 KB Output is correct
34 Correct 705 ms 41112 KB Output is correct
35 Correct 407 ms 31696 KB Output is correct
36 Correct 485 ms 36696 KB Output is correct
37 Correct 285 ms 30092 KB Output is correct
38 Correct 139 ms 27224 KB Output is correct
39 Correct 141 ms 34952 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 173 ms 26200 KB Output is correct
12 Correct 97 ms 17304 KB Output is correct
13 Correct 86 ms 17056 KB Output is correct
14 Correct 165 ms 24084 KB Output is correct
15 Correct 115 ms 23276 KB Output is correct
16 Correct 91 ms 18792 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 8 ms 7664 KB Output is correct
22 Correct 299 ms 31836 KB Output is correct
23 Correct 210 ms 27524 KB Output is correct
24 Correct 147 ms 21152 KB Output is correct
25 Correct 197 ms 25436 KB Output is correct
26 Correct 113 ms 24020 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 5 ms 7424 KB Output is correct
30 Correct 5 ms 7380 KB Output is correct
31 Correct 11 ms 8020 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct
33 Correct 5 ms 7536 KB Output is correct
34 Correct 705 ms 41112 KB Output is correct
35 Correct 407 ms 31696 KB Output is correct
36 Correct 485 ms 36696 KB Output is correct
37 Correct 285 ms 30092 KB Output is correct
38 Correct 139 ms 27224 KB Output is correct
39 Correct 141 ms 34952 KB Output is correct
40 Correct 10 ms 8148 KB Output is correct
41 Correct 16 ms 8472 KB Output is correct
42 Correct 10 ms 8020 KB Output is correct
43 Correct 10 ms 8020 KB Output is correct
44 Correct 1128 ms 53636 KB Output is correct
45 Correct 432 ms 35988 KB Output is correct
46 Correct 510 ms 38812 KB Output is correct
47 Correct 434 ms 34576 KB Output is correct
48 Correct 160 ms 31496 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7408 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7404 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 5 ms 7476 KB Output is correct
17 Correct 5 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7380 KB Output is correct
20 Correct 5 ms 7380 KB Output is correct
21 Correct 5 ms 7432 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 20 ms 9292 KB Output is correct
27 Correct 16 ms 8724 KB Output is correct
28 Correct 15 ms 8596 KB Output is correct
29 Correct 13 ms 8248 KB Output is correct
30 Correct 11 ms 8148 KB Output is correct
31 Correct 17 ms 8472 KB Output is correct
32 Correct 10 ms 8100 KB Output is correct
33 Correct 8 ms 8148 KB Output is correct
34 Correct 12 ms 8660 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 5 ms 7508 KB Output is correct
37 Correct 8 ms 8044 KB Output is correct
38 Correct 9 ms 8020 KB Output is correct
39 Correct 7 ms 7692 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 5 ms 7380 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 4 ms 7380 KB Output is correct
45 Correct 4 ms 7380 KB Output is correct
46 Correct 4 ms 7380 KB Output is correct
47 Correct 5 ms 7380 KB Output is correct
48 Correct 5 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 173 ms 26200 KB Output is correct
51 Correct 97 ms 17304 KB Output is correct
52 Correct 86 ms 17056 KB Output is correct
53 Correct 165 ms 24084 KB Output is correct
54 Correct 115 ms 23276 KB Output is correct
55 Correct 91 ms 18792 KB Output is correct
56 Correct 4 ms 7380 KB Output is correct
57 Correct 4 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 5 ms 7380 KB Output is correct
60 Correct 8 ms 7664 KB Output is correct
61 Correct 299 ms 31836 KB Output is correct
62 Correct 210 ms 27524 KB Output is correct
63 Correct 147 ms 21152 KB Output is correct
64 Correct 197 ms 25436 KB Output is correct
65 Correct 113 ms 24020 KB Output is correct
66 Correct 4 ms 7380 KB Output is correct
67 Correct 4 ms 7380 KB Output is correct
68 Correct 5 ms 7424 KB Output is correct
69 Correct 5 ms 7380 KB Output is correct
70 Correct 11 ms 8020 KB Output is correct
71 Correct 5 ms 7508 KB Output is correct
72 Correct 5 ms 7536 KB Output is correct
73 Correct 705 ms 41112 KB Output is correct
74 Correct 407 ms 31696 KB Output is correct
75 Correct 485 ms 36696 KB Output is correct
76 Correct 285 ms 30092 KB Output is correct
77 Correct 139 ms 27224 KB Output is correct
78 Correct 141 ms 34952 KB Output is correct
79 Correct 10 ms 8148 KB Output is correct
80 Correct 16 ms 8472 KB Output is correct
81 Correct 10 ms 8020 KB Output is correct
82 Correct 10 ms 8020 KB Output is correct
83 Correct 1128 ms 53636 KB Output is correct
84 Correct 432 ms 35988 KB Output is correct
85 Correct 510 ms 38812 KB Output is correct
86 Correct 434 ms 34576 KB Output is correct
87 Correct 160 ms 31496 KB Output is correct
88 Correct 1945 ms 96920 KB Output is correct
89 Correct 917 ms 58196 KB Output is correct
90 Correct 1373 ms 71668 KB Output is correct
91 Correct 622 ms 47788 KB Output is correct
92 Correct 927 ms 51440 KB Output is correct
93 Correct 798 ms 57108 KB Output is correct
94 Correct 600 ms 46636 KB Output is correct
95 Correct 291 ms 42032 KB Output is correct
96 Runtime error 568 ms 117044 KB Execution killed with signal 6
97 Halted 0 ms 0 KB -