제출 #1244108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1244108		m5588ohammed	Team Contest (JOI22_team)	C++20	9 / 100	24 ms	3912 KiB

team

#include <bits/stdc++.h>
#define endl "\n"
#define mod 1000000007
using namespace std;
#define int long long
array<int,3> arr[150001];
int fre[6][6][6];
int n;
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>arr[i][0]>>arr[i][1]>>arr[i][2];
        fre[arr[i][0]][arr[i][1]][arr[i][2]]=1;
    }
    int mx=-1;
    for(int x1=0;x1<=5;x1++){
        for(int y1=0;y1<=5;y1++){
            for(int z1=0;z1<=5;z1++){
                for(int x2=0;x2<=5;x2++){
                    for(int y2=0;y2<=5;y2++){
                        for(int z2=0;z2<=5;z2++){
                            for(int x3=0;x3<=5;x3++){
                                for(int y3=0;y3<=5;y3++){
                                    for(int z3=0;z3<=5;z3++){
                                        if(x1>max(x2,x3)&&y2>max(y1,y3)&&z3>max(z2,z1)&&fre[x1][y1][z1]==1&&fre[x2][y2][z2]==1&&fre[x3][y3][z3]==1){
                                            mx=max(mx,x1+y2+z3);
                                        }   
                                    }
                                }    
                            }     
                        }
                    }    
                }   
            }
        }    
    }
    cout<<mx<<endl;
}

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