oj.uz

답안 #586154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586154 2022-06-30T02:43:19 Z abcvuitunggio Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 92468 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<=n;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) {
    if (x==szx||yy==szy)
        return;
    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)
            bit[x][y-1]=max(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<=n;i++){
        for (int j=0;j<node[i].size();j++)
            bit[i].push_back(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();
                }
        }
        pending.push_back(make_pair(x[i],p[i][0]));
        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:39:85: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int y=lower_bound(node[x].begin(),node[x].end(),yy)-node[x].begin()+1;y<=node[x].size();y+=y&-y)
      |                                                                                    ~^~~~~~~~~~~~~~~~
team.cpp: In function 'int main()':
team.cpp:106:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |         for (int j=0;j<node[i].size();j++)
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7284 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 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7352 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 4 ms 7400 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 5 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 4 ms 7380 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7432 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 4 ms 7284 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 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7352 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 4 ms 7400 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 5 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 4 ms 7380 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7432 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 25 ms 9184 KB Output is correct
27 Correct 18 ms 8788 KB Output is correct
28 Correct 15 ms 8532 KB Output is correct
29 Correct 15 ms 8276 KB Output is correct
30 Correct 12 ms 8184 KB Output is correct
31 Correct 16 ms 8532 KB Output is correct
32 Correct 10 ms 8016 KB Output is correct
33 Correct 7 ms 8148 KB Output is correct
34 Correct 11 ms 8532 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 6 ms 7508 KB Output is correct
37 Correct 8 ms 8020 KB Output is correct
38 Correct 8 ms 8020 KB Output is correct
39 Correct 6 ms 7636 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7508 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 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 4 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 119 ms 22184 KB Output is correct
12 Correct 66 ms 17124 KB Output is correct
13 Correct 63 ms 17208 KB Output is correct
14 Correct 100 ms 22912 KB Output is correct
15 Correct 87 ms 23080 KB Output is correct
16 Correct 59 ms 23288 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7508 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 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 4 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 119 ms 22184 KB Output is correct
12 Correct 66 ms 17124 KB Output is correct
13 Correct 63 ms 17208 KB Output is correct
14 Correct 100 ms 22912 KB Output is correct
15 Correct 87 ms 23080 KB Output is correct
16 Correct 59 ms 23288 KB Output is correct
17 Correct 4 ms 7404 KB Output is correct
18 Correct 4 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 7 ms 7636 KB Output is correct
22 Correct 257 ms 28188 KB Output is correct
23 Correct 155 ms 23972 KB Output is correct
24 Correct 112 ms 19048 KB Output is correct
25 Correct 147 ms 23244 KB Output is correct
26 Correct 85 ms 23544 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7508 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 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 4 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 119 ms 22184 KB Output is correct
12 Correct 66 ms 17124 KB Output is correct
13 Correct 63 ms 17208 KB Output is correct
14 Correct 100 ms 22912 KB Output is correct
15 Correct 87 ms 23080 KB Output is correct
16 Correct 59 ms 23288 KB Output is correct
17 Correct 4 ms 7404 KB Output is correct
18 Correct 4 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 7 ms 7636 KB Output is correct
22 Correct 257 ms 28188 KB Output is correct
23 Correct 155 ms 23972 KB Output is correct
24 Correct 112 ms 19048 KB Output is correct
25 Correct 147 ms 23244 KB Output is correct
26 Correct 85 ms 23544 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7380 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 8020 KB Output is correct
32 Correct 4 ms 7540 KB Output is correct
33 Correct 6 ms 7508 KB Output is correct
34 Correct 799 ms 37808 KB Output is correct
35 Correct 377 ms 28676 KB Output is correct
36 Correct 487 ms 33668 KB Output is correct
37 Correct 272 ms 28212 KB Output is correct
38 Correct 125 ms 27132 KB Output is correct
39 Correct 120 ms 30368 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7508 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 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 4 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 119 ms 22184 KB Output is correct
12 Correct 66 ms 17124 KB Output is correct
13 Correct 63 ms 17208 KB Output is correct
14 Correct 100 ms 22912 KB Output is correct
15 Correct 87 ms 23080 KB Output is correct
16 Correct 59 ms 23288 KB Output is correct
17 Correct 4 ms 7404 KB Output is correct
18 Correct 4 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 7 ms 7636 KB Output is correct
22 Correct 257 ms 28188 KB Output is correct
23 Correct 155 ms 23972 KB Output is correct
24 Correct 112 ms 19048 KB Output is correct
25 Correct 147 ms 23244 KB Output is correct
26 Correct 85 ms 23544 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7380 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 8020 KB Output is correct
32 Correct 4 ms 7540 KB Output is correct
33 Correct 6 ms 7508 KB Output is correct
34 Correct 799 ms 37808 KB Output is correct
35 Correct 377 ms 28676 KB Output is correct
36 Correct 487 ms 33668 KB Output is correct
37 Correct 272 ms 28212 KB Output is correct
38 Correct 125 ms 27132 KB Output is correct
39 Correct 120 ms 30368 KB Output is correct
40 Correct 10 ms 8148 KB Output is correct
41 Correct 15 ms 8456 KB Output is correct
42 Correct 8 ms 8032 KB Output is correct
43 Correct 9 ms 8020 KB Output is correct
44 Correct 1456 ms 51416 KB Output is correct
45 Correct 438 ms 34192 KB Output is correct
46 Correct 537 ms 37056 KB Output is correct
47 Correct 429 ms 32800 KB Output is correct
48 Correct 131 ms 30184 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7284 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 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7352 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 4 ms 7400 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 5 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 4 ms 7380 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7432 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 25 ms 9184 KB Output is correct
27 Correct 18 ms 8788 KB Output is correct
28 Correct 15 ms 8532 KB Output is correct
29 Correct 15 ms 8276 KB Output is correct
30 Correct 12 ms 8184 KB Output is correct
31 Correct 16 ms 8532 KB Output is correct
32 Correct 10 ms 8016 KB Output is correct
33 Correct 7 ms 8148 KB Output is correct
34 Correct 11 ms 8532 KB Output is correct
35 Correct 5 ms 7508 KB Output is correct
36 Correct 6 ms 7508 KB Output is correct
37 Correct 8 ms 8020 KB Output is correct
38 Correct 8 ms 8020 KB Output is correct
39 Correct 6 ms 7636 KB Output is correct
40 Correct 4 ms 7508 KB Output is correct
41 Correct 5 ms 7380 KB Output is correct
42 Correct 4 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 4 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 119 ms 22184 KB Output is correct
51 Correct 66 ms 17124 KB Output is correct
52 Correct 63 ms 17208 KB Output is correct
53 Correct 100 ms 22912 KB Output is correct
54 Correct 87 ms 23080 KB Output is correct
55 Correct 59 ms 23288 KB Output is correct
56 Correct 4 ms 7404 KB Output is correct
57 Correct 4 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 7 ms 7636 KB Output is correct
61 Correct 257 ms 28188 KB Output is correct
62 Correct 155 ms 23972 KB Output is correct
63 Correct 112 ms 19048 KB Output is correct
64 Correct 147 ms 23244 KB Output is correct
65 Correct 85 ms 23544 KB Output is correct
66 Correct 4 ms 7380 KB Output is correct
67 Correct 4 ms 7380 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 8020 KB Output is correct
71 Correct 4 ms 7540 KB Output is correct
72 Correct 6 ms 7508 KB Output is correct
73 Correct 799 ms 37808 KB Output is correct
74 Correct 377 ms 28676 KB Output is correct
75 Correct 487 ms 33668 KB Output is correct
76 Correct 272 ms 28212 KB Output is correct
77 Correct 125 ms 27132 KB Output is correct
78 Correct 120 ms 30368 KB Output is correct
79 Correct 10 ms 8148 KB Output is correct
80 Correct 15 ms 8456 KB Output is correct
81 Correct 8 ms 8032 KB Output is correct
82 Correct 9 ms 8020 KB Output is correct
83 Correct 1456 ms 51416 KB Output is correct
84 Correct 438 ms 34192 KB Output is correct
85 Correct 537 ms 37056 KB Output is correct
86 Correct 429 ms 32800 KB Output is correct
87 Correct 131 ms 30184 KB Output is correct
88 Execution timed out 2080 ms 92468 KB Time limit exceeded
89 Halted 0 ms 0 KB -