Submission #795031

#	Time	Username	Problem	Language	Result	Execution time	Memory
795031		vjudge1	Team Contest (JOI22_team)	C++14	8 / 100	140 ms	2072 KiB

team

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std ;
const int N = 15e4 ;
int n, ans = -1, x[N + 1], y[N + 1], z[N + 1] ;
vector<pair<int, pair<int, int>>> z_s ;
int func(int i, int j, int q)
{
    if(x[i] > x[j] && x[i] > x[q] && y[j] > y[i] && y[j] > y[q] && z[i] < z[q] && z[j] < z[q])
        return x[i] + y[j] + z[q] ;
    else
        return -1 ;
}
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    for(int i = 1 ; i <= n ; i++)
        cin >> x[i] >> y[i] >> z[i] ;
    if(n <= 300)
    {
        for(int i = 1 ; i <= n ; i++)
            for(int j = 1 ; j <= n ; j++)
            {
                if(i == j)
                    continue ;
                for(int q = 1 ; q <= n ; q++)
                {
                    if(j == q || i == q)
                        continue ;
                    ans = max(ans, func(i, j, q)) ;
                }
            }
        cout << ans << '\n' ;
        return 0 ;
    }
    if(n <= 4000)
    {
        cout << ans << '\n' ;
        return 0 ;
    }
    return 0 ;
}

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