제출 #719678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
719678		lam	Team Contest (JOI22_team)	C++14	8 / 100	2080 ms	4612 KiB

team

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 5e4 + 10;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
#define ff first
#define ss second
int n;
iii a[maxn];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i].ff>>a[i].ss.ff>>a[i].ss.ss;
    int ans=-1;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            if (a[i].ff>a[j].ff&&a[j].ss.ff>a[i].ss.ff)
            for (int z=1; z<=n; z++)
                if (a[i].ff>a[z].ff&&a[j].ss.ff>a[z].ss.ff&&a[z].ss.ss>max(a[i].ss.ss,a[j].ss.ss)) ans=max(ans,a[i].ff+a[j].ss.ff+a[z].ss.ss);
    cout<<ans<<'\n';
}

• 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