제출 #634509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634509		Darren0724	Team Contest (JOI22_team)	C++17	0 / 100	57 ms	468 KiB

team

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define rz resize
#define pb emplace_back
int INF=1e18;
int mod=1e9+7;
int N=4000;

signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;cin>>n;
  vector<int> a(n),b(n),c(n);
  vector<vector<pii>> v(N+1);
  for(int i=0;i<n;i++){
    cin>>a[i]>>b[i]>>c[i];
    v[a[i]].push_back({b[i],c[i]});
  }
  vector<int> rec(N+2),rec1(N+2);
  int ans=-1;
  for(int i=1;i<=N;i++){
    for(auto p:v[i]){
      if(p.second<rec[p.first+1]){
        ans=max(ans,i+rec[p.first+1]+p.first);
      }
    }
    for(auto p:v[i]){
      rec[p.first]=max(rec[p.first],p.second);
    }
    for(int j=2;j<=N;j++){
      rec[j]=max(rec[j],rec[j-1]);
    }
    for(auto p:v[i]){
      if(rec[p.first-1]>p.second){
        rec1[p.first]=max(rec[p.first-1],rec1[p.first]);
      }
    }
  }
  cout<<ans<<endl;

  return 0;
}

• Subtask 1: 0 / 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