제출 #1004077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004077		De3b0o	Team Contest (JOI22_team)	C++14	55 / 100	2089 ms	145744 KiB

team

#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)

using namespace std;

ll n;
ll X[150009];
ll Y[150009];
ll Z[150009];
ll ox[150009];
ll oy[150009];
ll oz[150009];

ll mx[4009][4009];

int main()
{
    d3
    cin >> n;
    set<ll> s1 , s2 , s3;
    map<ll,ll> mp1 , mp2 , mp3;
    map<pair<pll,ll>,ll> mp;
    int i = 0;
    while(n--)
    {
        ll x , y , z;
        cin >> x >> y >> z;
        if(mp[{{x,y},z}])
            continue;
        mp[{{x,y},z}]=1;
        X[i]=x;
        Y[i]=y;
        Z[i]=z;
        s1.in(X[i]);
        s2.in(Y[i]);
        s3.in(Z[i]);
        i++;
    }
    n=i;
    ll t = 0;
    for(auto it : s1)
    {
        mp1[it]=t;
        ox[t]=it;
        t++;
    }
    t=0;
    for(auto it : s2)
    {
        mp2[it]=t;
        oy[t]=it;
        t++;
    }
    t=0;
    for(auto it : s3)
    {
        mp3[it]=t;
        oz[t]=it;
        t++;
    }
    for(int i = 0 ; n>i ; i++)
    {
        X[i]=mp1[X[i]];
        Y[i]=mp2[Y[i]];
        Z[i]=mp3[Z[i]];
        mx[X[i]][Y[i]]=max(mx[X[i]][Y[i]],Z[i]);
    }
    for(int i = 1 ; 4009 > i ; i++)
        mx[i][0]=max(mx[i][0],mx[i-1][0]);
    for(int i = 1 ; 4009 > i ; i++)
        mx[0][i]=max(mx[0][i],mx[0][i-1]);
    for(int i = 1 ; 4009>i ; i++)
        for(int j = 1 ; 4009>j ; j++)
            mx[i][j]=max(mx[i][j],max(mx[i-1][j],mx[i][j-1]));
    ll ans = -1;
    for(int i = 0 ; n>i ; i++)
    {
        for(int j = 0 ; n>j ; j++)
        {
            if(i==j)
                continue;
            if(X[i]>X[j]&&Y[j]>Y[i])
            {
                if(max(Z[i],Z[j])>=mx[X[i]-1][Y[j]-1])
                    continue;
                ans=max(ans,ox[X[i]]+oy[Y[j]]+oz[mx[X[i]-1][Y[j]-1]]);
            }
        }
    }
    cans
}

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27