Submission #634536

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
634536	2022-08-24T14:30:58 Z	Darren0724	Team Contest (JOI22_team)	C++17	0 / 100	526 ms	6432 KB

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=4010;

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]){
      for(int j=1;j<=N;j++){
        if(rec1[j]>p.second)ans=max(ans,i+j+rec1[j]);
      }
    }
    for(auto p:v[i]){
      rec[p.first+1]=max(rec[p.first+1],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]>p.second){
        rec1[p.first]=max(rec[p.first],rec1[p.first]);
      }
    }
    for(int j=N-1;j>=0;j--){
      rec1[j]=max(rec1[j],rec1[j+1]);
    }
  }
  cout<<ans<<endl;

  return 0;
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	340 KB	Output is correct
2	Correct	105 ms	468 KB	Output is correct
3	Correct	106 ms	468 KB	Output is correct
4	Correct	108 ms	468 KB	Output is correct
5	Correct	105 ms	468 KB	Output is correct
6	Correct	105 ms	468 KB	Output is correct
7	Correct	105 ms	468 KB	Output is correct
8	Correct	107 ms	448 KB	Output is correct
9	Correct	107 ms	468 KB	Output is correct
10	Correct	105 ms	448 KB	Output is correct
11	Correct	105 ms	468 KB	Output is correct
12	Correct	104 ms	448 KB	Output is correct
13	Correct	107 ms	468 KB	Output is correct
14	Runtime error	1 ms	596 KB	Execution killed with signal 11
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	340 KB	Output is correct
2	Correct	105 ms	468 KB	Output is correct
3	Correct	106 ms	468 KB	Output is correct
4	Correct	108 ms	468 KB	Output is correct
5	Correct	105 ms	468 KB	Output is correct
6	Correct	105 ms	468 KB	Output is correct
7	Correct	105 ms	468 KB	Output is correct
8	Correct	107 ms	448 KB	Output is correct
9	Correct	107 ms	468 KB	Output is correct
10	Correct	105 ms	448 KB	Output is correct
11	Correct	105 ms	468 KB	Output is correct
12	Correct	104 ms	448 KB	Output is correct
13	Correct	107 ms	468 KB	Output is correct
14	Runtime error	1 ms	596 KB	Execution killed with signal 11
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	448 KB	Output is correct
2	Correct	104 ms	468 KB	Output is correct
3	Correct	107 ms	468 KB	Output is correct
4	Correct	106 ms	464 KB	Output is correct
5	Correct	108 ms	468 KB	Output is correct
6	Correct	108 ms	468 KB	Output is correct
7	Correct	105 ms	460 KB	Output is correct
8	Correct	108 ms	468 KB	Output is correct
9	Correct	106 ms	468 KB	Output is correct
10	Correct	109 ms	460 KB	Output is correct
11	Correct	526 ms	6432 KB	Output is correct
12	Incorrect	391 ms	4828 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	448 KB	Output is correct
2	Correct	104 ms	468 KB	Output is correct
3	Correct	107 ms	468 KB	Output is correct
4	Correct	106 ms	464 KB	Output is correct
5	Correct	108 ms	468 KB	Output is correct
6	Correct	108 ms	468 KB	Output is correct
7	Correct	105 ms	460 KB	Output is correct
8	Correct	108 ms	468 KB	Output is correct
9	Correct	106 ms	468 KB	Output is correct
10	Correct	109 ms	460 KB	Output is correct
11	Correct	526 ms	6432 KB	Output is correct
12	Incorrect	391 ms	4828 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	448 KB	Output is correct
2	Correct	104 ms	468 KB	Output is correct
3	Correct	107 ms	468 KB	Output is correct
4	Correct	106 ms	464 KB	Output is correct
5	Correct	108 ms	468 KB	Output is correct
6	Correct	108 ms	468 KB	Output is correct
7	Correct	105 ms	460 KB	Output is correct
8	Correct	108 ms	468 KB	Output is correct
9	Correct	106 ms	468 KB	Output is correct
10	Correct	109 ms	460 KB	Output is correct
11	Correct	526 ms	6432 KB	Output is correct
12	Incorrect	391 ms	4828 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	106 ms	448 KB	Output is correct
2	Correct	104 ms	468 KB	Output is correct
3	Correct	107 ms	468 KB	Output is correct
4	Correct	106 ms	464 KB	Output is correct
5	Correct	108 ms	468 KB	Output is correct
6	Correct	108 ms	468 KB	Output is correct
7	Correct	105 ms	460 KB	Output is correct
8	Correct	108 ms	468 KB	Output is correct
9	Correct	106 ms	468 KB	Output is correct
10	Correct	109 ms	460 KB	Output is correct
11	Correct	526 ms	6432 KB	Output is correct
12	Incorrect	391 ms	4828 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	340 KB	Output is correct
2	Correct	105 ms	468 KB	Output is correct
3	Correct	106 ms	468 KB	Output is correct
4	Correct	108 ms	468 KB	Output is correct
5	Correct	105 ms	468 KB	Output is correct
6	Correct	105 ms	468 KB	Output is correct
7	Correct	105 ms	468 KB	Output is correct
8	Correct	107 ms	448 KB	Output is correct
9	Correct	107 ms	468 KB	Output is correct
10	Correct	105 ms	448 KB	Output is correct
11	Correct	105 ms	468 KB	Output is correct
12	Correct	104 ms	448 KB	Output is correct
13	Correct	107 ms	468 KB	Output is correct
14	Runtime error	1 ms	596 KB	Execution killed with signal 11
15	Halted	0 ms	0 KB	-