Submission #1004033

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004033		edogawa_something	Team Contest (JOI22_team)	C++17	27 / 100	430 ms	640944 KiB

team

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first 
#define S second 
#define all(v) v.begin(),v.end()
#define pb push_back
#define pow poww
const int M=301;
const ll mod=998244353;
const ll inf=2e18;
const ll dx[]={1,-1,0,0};
const ll dy[]={0,0,1,-1};
ll pow(ll x,ll y){
  ll res=1;
  x%=mod;
  while(y>0){
    if(y%2==1){
      res*=x,res%=mod;
    }
    x*=x,x%=mod;
    y/=2;
  }
  return res;
}
ll n,ma[M][M][M][3];
int main(){
  ios_base::sync_with_stdio(0),cin.tie(0);
  ll TC=1;
  //cin>>TC;
  while(TC--){
    cin>>n;
    for(int i=0;i<n;i++){
      ll x,y,z;
      cin>>x>>y>>z;
      ma[x][y][z][0]=ma[x][y][z][1]=ma[x][y][z][2]=1;;
    }
    for(int i=1;i<=300;i++){
      for(int j=1;j<=300;j++){
        for(int k=1;k<=300;k++){
          ma[i][j][k][0]|=ma[i][j-1][k][0];
          ma[i][j][k][0]|=ma[i][j][k-1][0];
          ma[i][j][k][1]|=ma[i-1][j][k][1];
          ma[i][j][k][1]|=ma[i][j][k-1][1];
          ma[i][j][k][2]|=ma[i-1][j][k][2];
          ma[i][j][k][2]|=ma[i][j-1][k][2];
        }
      }
    }
    int ans=-1;
    for(int i=1;i<=300;i++){
      for(int j=1;j<=300;j++){
        for(int k=1;k<=300;k++){
          if(ma[i][j-1][k-1][0]&&ma[i-1][j][k-1][1]&&ma[i-1][j-1][k][2])
          ans=max(ans,i+j+k);
        }
      }
    }
    cout<<ans;
  }
  return 0;
}
/*
 
*/

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