Submission #861060

#TimeUsernameProblemLanguageResultExecution timeMemory
861060willychanTeam Contest (JOI22_team)C++14
27 / 100
241 ms335248 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; //#include<bits/extc++.h> //__gnu_pbds const int N = 305; int Xsum[N][N][N]; int Ysum[N][N][N]; int Zsum[N][N][N]; int main(){ ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0); int n;cin>>n; for(int i=0;i<n;i++){ int a,b,c;cin>>a>>b>>c; Xsum[a][b][c]++; Ysum[b][a][c]++; Zsum[c][a][b]++; } for(int i=1;i<N;i++){ for(int j=1;j<N;j++){ for(int k=1;k<N;k++){ Xsum[i][j][k] = Xsum[i][j][k]+Xsum[i][j-1][k]+Xsum[i][j][k-1]-Xsum[i][j-1][k-1]; Ysum[i][j][k] = Ysum[i][j][k]+Ysum[i][j-1][k]+Ysum[i][j][k-1]-Ysum[i][j-1][k-1]; Zsum[i][j][k] = Zsum[i][j][k]+Zsum[i][j-1][k]+Zsum[i][j][k-1]-Zsum[i][j-1][k-1]; } } } int ans = -1; for(int i=1;i<N;i++){ for(int j=1;j<N;j++){ for(int k=1;k<N;k++){ if(Xsum[i][j-1][k-1] && Ysum[j][i-1][k-1] && Zsum[k][i-1][j-1]) ans = max(ans,i+j+k); } } } cout<<ans<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...