oj.uz

답안 #586158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586158 2022-06-30T02:58:06 Z abcvuitunggio Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 90152 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstdio>
using namespace std;
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;
void update(int x, int val, int idx){
    for (;x<=max(szx,szy);x+=x&(-x))
        ft[x][idx]=max(ft[x][idx],val);
}
int get(int i, int idx){
    int res=0;
    for (;i;i-=i&(-i))
        res=max(res,ft[i][idx]);
    return res;
}
void fakeUpdate(int x, int y){
    if (x==szx||y==szy)
        return;
    for (;x<=szx;x+=x&-x)
        node[x].push_back(y);
}
void fakeGet(int x, int y){
    for (;x;x-=x&-x)
        node[x].push_back(y);
}
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;
        }
}
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;
}
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];
        fakeUpdate(p[i][0].x,p[i][0].y);
        fakeUpdate(p[i][1].x,p[i][1].y);
        fakeGet(y[i]-1,z[i]-1);
    }
    for (int i=1;i<=max(szx,szy);i++){
        bit[i].resize(node[i].size(),mn);
        sort(node[i].begin(),node[i].end());
    }
    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:37:85: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7352 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 7288 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 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7376 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 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 7408 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 4 ms 7380 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7352 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 7288 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 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7376 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 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 7408 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 4 ms 7380 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 21 ms 9160 KB Output is correct
27 Correct 18 ms 8640 KB Output is correct
28 Correct 14 ms 8472 KB Output is correct
29 Correct 12 ms 8276 KB Output is correct
30 Correct 12 ms 8148 KB Output is correct
31 Correct 16 ms 8420 KB Output is correct
32 Correct 10 ms 7952 KB Output is correct
33 Correct 8 ms 8020 KB Output is correct
34 Correct 12 ms 8532 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 5 ms 7508 KB Output is correct
37 Correct 7 ms 8020 KB Output is correct
38 Correct 8 ms 8020 KB Output is correct
39 Correct 7 ms 7636 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7392 KB Output is correct
6 Correct 5 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 105 ms 21504 KB Output is correct
12 Correct 58 ms 15368 KB Output is correct
13 Correct 51 ms 15160 KB Output is correct
14 Correct 83 ms 20832 KB Output is correct
15 Correct 69 ms 19588 KB Output is correct
16 Correct 41 ms 15024 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7392 KB Output is correct
6 Correct 5 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 105 ms 21504 KB Output is correct
12 Correct 58 ms 15368 KB Output is correct
13 Correct 51 ms 15160 KB Output is correct
14 Correct 83 ms 20832 KB Output is correct
15 Correct 69 ms 19588 KB Output is correct
16 Correct 41 ms 15024 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 3 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 8 ms 7636 KB Output is correct
22 Correct 226 ms 26516 KB Output is correct
23 Correct 147 ms 23320 KB Output is correct
24 Correct 95 ms 18460 KB Output is correct
25 Correct 135 ms 22064 KB Output is correct
26 Correct 67 ms 20400 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7392 KB Output is correct
6 Correct 5 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 105 ms 21504 KB Output is correct
12 Correct 58 ms 15368 KB Output is correct
13 Correct 51 ms 15160 KB Output is correct
14 Correct 83 ms 20832 KB Output is correct
15 Correct 69 ms 19588 KB Output is correct
16 Correct 41 ms 15024 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 3 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 8 ms 7636 KB Output is correct
22 Correct 226 ms 26516 KB Output is correct
23 Correct 147 ms 23320 KB Output is correct
24 Correct 95 ms 18460 KB Output is correct
25 Correct 135 ms 22064 KB Output is correct
26 Correct 67 ms 20400 KB Output is correct
27 Correct 4 ms 7404 KB Output is correct
28 Correct 4 ms 7460 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 10 ms 7892 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct
33 Correct 4 ms 7508 KB Output is correct
34 Correct 718 ms 35876 KB Output is correct
35 Correct 347 ms 27952 KB Output is correct
36 Correct 471 ms 31992 KB Output is correct
37 Correct 265 ms 26796 KB Output is correct
38 Correct 86 ms 23728 KB Output is correct
39 Correct 125 ms 28776 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7392 KB Output is correct
6 Correct 5 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 105 ms 21504 KB Output is correct
12 Correct 58 ms 15368 KB Output is correct
13 Correct 51 ms 15160 KB Output is correct
14 Correct 83 ms 20832 KB Output is correct
15 Correct 69 ms 19588 KB Output is correct
16 Correct 41 ms 15024 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 3 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 8 ms 7636 KB Output is correct
22 Correct 226 ms 26516 KB Output is correct
23 Correct 147 ms 23320 KB Output is correct
24 Correct 95 ms 18460 KB Output is correct
25 Correct 135 ms 22064 KB Output is correct
26 Correct 67 ms 20400 KB Output is correct
27 Correct 4 ms 7404 KB Output is correct
28 Correct 4 ms 7460 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 10 ms 7892 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct
33 Correct 4 ms 7508 KB Output is correct
34 Correct 718 ms 35876 KB Output is correct
35 Correct 347 ms 27952 KB Output is correct
36 Correct 471 ms 31992 KB Output is correct
37 Correct 265 ms 26796 KB Output is correct
38 Correct 86 ms 23728 KB Output is correct
39 Correct 125 ms 28776 KB Output is correct
40 Correct 11 ms 8020 KB Output is correct
41 Correct 17 ms 8404 KB Output is correct
42 Correct 8 ms 8020 KB Output is correct
43 Correct 10 ms 7984 KB Output is correct
44 Correct 1172 ms 48000 KB Output is correct
45 Correct 440 ms 32264 KB Output is correct
46 Correct 560 ms 34560 KB Output is correct
47 Correct 414 ms 31064 KB Output is correct
48 Correct 122 ms 27552 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7352 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 7288 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 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 4 ms 7376 KB Output is correct
14 Correct 4 ms 7508 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 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 7408 KB Output is correct
20 Correct 4 ms 7380 KB Output is correct
21 Correct 4 ms 7380 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 21 ms 9160 KB Output is correct
27 Correct 18 ms 8640 KB Output is correct
28 Correct 14 ms 8472 KB Output is correct
29 Correct 12 ms 8276 KB Output is correct
30 Correct 12 ms 8148 KB Output is correct
31 Correct 16 ms 8420 KB Output is correct
32 Correct 10 ms 7952 KB Output is correct
33 Correct 8 ms 8020 KB Output is correct
34 Correct 12 ms 8532 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 5 ms 7508 KB Output is correct
37 Correct 7 ms 8020 KB Output is correct
38 Correct 8 ms 8020 KB Output is correct
39 Correct 7 ms 7636 KB Output is correct
40 Correct 3 ms 7380 KB Output is correct
41 Correct 4 ms 7380 KB Output is correct
42 Correct 3 ms 7380 KB Output is correct
43 Correct 5 ms 7380 KB Output is correct
44 Correct 5 ms 7392 KB Output is correct
45 Correct 5 ms 7380 KB Output is correct
46 Correct 4 ms 7380 KB Output is correct
47 Correct 4 ms 7380 KB Output is correct
48 Correct 4 ms 7380 KB Output is correct
49 Correct 4 ms 7380 KB Output is correct
50 Correct 105 ms 21504 KB Output is correct
51 Correct 58 ms 15368 KB Output is correct
52 Correct 51 ms 15160 KB Output is correct
53 Correct 83 ms 20832 KB Output is correct
54 Correct 69 ms 19588 KB Output is correct
55 Correct 41 ms 15024 KB Output is correct
56 Correct 3 ms 7380 KB Output is correct
57 Correct 3 ms 7380 KB Output is correct
58 Correct 4 ms 7380 KB Output is correct
59 Correct 4 ms 7380 KB Output is correct
60 Correct 8 ms 7636 KB Output is correct
61 Correct 226 ms 26516 KB Output is correct
62 Correct 147 ms 23320 KB Output is correct
63 Correct 95 ms 18460 KB Output is correct
64 Correct 135 ms 22064 KB Output is correct
65 Correct 67 ms 20400 KB Output is correct
66 Correct 4 ms 7404 KB Output is correct
67 Correct 4 ms 7460 KB Output is correct
68 Correct 4 ms 7380 KB Output is correct
69 Correct 4 ms 7380 KB Output is correct
70 Correct 10 ms 7892 KB Output is correct
71 Correct 5 ms 7508 KB Output is correct
72 Correct 4 ms 7508 KB Output is correct
73 Correct 718 ms 35876 KB Output is correct
74 Correct 347 ms 27952 KB Output is correct
75 Correct 471 ms 31992 KB Output is correct
76 Correct 265 ms 26796 KB Output is correct
77 Correct 86 ms 23728 KB Output is correct
78 Correct 125 ms 28776 KB Output is correct
79 Correct 11 ms 8020 KB Output is correct
80 Correct 17 ms 8404 KB Output is correct
81 Correct 8 ms 8020 KB Output is correct
82 Correct 10 ms 7984 KB Output is correct
83 Correct 1172 ms 48000 KB Output is correct
84 Correct 440 ms 32264 KB Output is correct
85 Correct 560 ms 34560 KB Output is correct
86 Correct 414 ms 31064 KB Output is correct
87 Correct 122 ms 27552 KB Output is correct
88 Execution timed out 2068 ms 90152 KB Time limit exceeded
89 Halted 0 ms 0 KB -