oj.uz

Submission #586141

# Submission time Handle Problem Language Result Execution time Memory
586141 2022-06-30T02:21:18 Z abcvuitunggio Team Contest (JOI22_team) C++17
0 / 100
 5 ms 7408 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
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,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=-1000000000;
    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 i=0;i<n;i++){
        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++){
        bit[i].resize(node[i].size());
        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?res:-1);
}

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
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Incorrect 4 ms 7380 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Incorrect 4 ms 7380 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 7380 KB Output is correct
5 Incorrect 5 ms 7408 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 7380 KB Output is correct
5 Incorrect 5 ms 7408 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 7380 KB Output is correct
5 Incorrect 5 ms 7408 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 7380 KB Output is correct
5 Incorrect 5 ms 7408 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Incorrect 4 ms 7380 KB Output isn't correct
6 Halted 0 ms 0 KB -