oj.uz

Submission #634566

# Submission time Handle Problem Language Result Execution time Memory
634566 2022-08-24T15:02:58 Z Darren0724 Team Contest (JOI22_team) C++17
8 / 100
 734 ms 6428 KB 
#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;
  if(n<=300){
    vector<int> a(n),b(n),c(n);
    for(int i=0;i<n;i++){
      cin>>a[i]>>b[i]>>c[i];
    }
    int ans=-1;
    for(int i=0;i<n;i++){
      for(int j=0;j<n;j++){
        for(int k=0;k<n;k++){
          if(i==j||j==k||i==k){
            continue;
          }
          if(a[i]<=a[j]||a[i]<=a[k]||b[j]<=b[i]||b[j]<=b[k]||c[k]<=c[i]||c[k]<=c[j]){
            continue;
          }
          ans=max(ans,a[i]+b[j]+c[k]);
        }
      }
    }
    cout<<ans<<endl;
    return 0;
  }
  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,-INF),rec1(N+2,-INF);
  int ans=-INF;
  for(int i=1;i<=N;i++){
    for(auto p:v[i]){
      for(int j=p.first+1;j<=N+1;j++){
        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=1;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]);
    }
  }
  if(ans<0){
    cout<<-1<<endl;
  }
  else{
    cout<<ans<<endl;
  }

  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 80 ms 312 KB Output is correct
15 Correct 30 ms 212 KB Output is correct
16 Correct 49 ms 212 KB Output is correct
17 Correct 57 ms 308 KB Output is correct
18 Correct 61 ms 308 KB Output is correct
19 Correct 75 ms 304 KB Output is correct
20 Correct 55 ms 308 KB Output is correct
21 Correct 53 ms 212 KB Output is correct
22 Correct 45 ms 212 KB Output is correct
23 Correct 39 ms 212 KB Output is correct
24 Correct 41 ms 212 KB Output is correct
25 Correct 41 ms 212 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 80 ms 312 KB Output is correct
15 Correct 30 ms 212 KB Output is correct
16 Correct 49 ms 212 KB Output is correct
17 Correct 57 ms 308 KB Output is correct
18 Correct 61 ms 308 KB Output is correct
19 Correct 75 ms 304 KB Output is correct
20 Correct 55 ms 308 KB Output is correct
21 Correct 53 ms 212 KB Output is correct
22 Correct 45 ms 212 KB Output is correct
23 Correct 39 ms 212 KB Output is correct
24 Correct 41 ms 212 KB Output is correct
25 Correct 41 ms 212 KB Output is correct
26 Runtime error 2 ms 852 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 228 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 734 ms 6428 KB Output is correct
12 Incorrect 535 ms 4820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 228 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 734 ms 6428 KB Output is correct
12 Incorrect 535 ms 4820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 228 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 734 ms 6428 KB Output is correct
12 Incorrect 535 ms 4820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 228 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 734 ms 6428 KB Output is correct
12 Incorrect 535 ms 4820 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 80 ms 312 KB Output is correct
15 Correct 30 ms 212 KB Output is correct
16 Correct 49 ms 212 KB Output is correct
17 Correct 57 ms 308 KB Output is correct
18 Correct 61 ms 308 KB Output is correct
19 Correct 75 ms 304 KB Output is correct
20 Correct 55 ms 308 KB Output is correct
21 Correct 53 ms 212 KB Output is correct
22 Correct 45 ms 212 KB Output is correct
23 Correct 39 ms 212 KB Output is correct
24 Correct 41 ms 212 KB Output is correct
25 Correct 41 ms 212 KB Output is correct
26 Runtime error 2 ms 852 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -