oj.uz

Submission #626301

# Submission time Handle Problem Language Result Execution time Memory
626301 2022-08-11T11:14:04 Z sword060 Catfish Farm (IOI22_fish) C++17
9 / 100
 33 ms 13708 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
long long dp[100005][2],ar[100005];
long long rec(int i,bool f,int m){
  if(i>=m)return 0;
  if(~dp[i][f])return dp[i][f];
  long long z=rec(i+1,0,m);
  if(!f)return dp[i][0]=max(z,rec(i+1,1,m)+ar[i]);
  if(i<m-1)return dp[i][1]=max(z,rec(i+2,0,m)+ar[i]);
  return dp[i][1]=0;
}
long long max_weights(int x,int k,vector<int> a,vector<int> b,vector<int> c){
  vector<pair<int,int>>l[2];
  long long ans=0,cur=0,cur2=0;
  bool f=1;
  for(int i=0;i<k;i++){
    l[a[i]%2].push_back({b[i],c[i]});
    if(a[i]%2)cur+=c[i];
    else cur2+=c[i];
    f&=(b[i]==0);
  }
    for(int i=0;i<x;i++)dp[i][0]=-1,dp[i][1]=-1,ar[i]=0;
    for(int i=0;i<k;i++)ar[a[i]]=c[i];
    return rec(0,1,x);

  sort(l[0].begin(),l[0].end());
  sort(l[1].begin(),l[1].end());
  ans=cur;
  if(x<=2){
    return max(cur,cur2);
  }
  int j=0;
  for(int i=0;i<(int)l[0].size();i++){
    cur+=l[0][i].second;
    while(j<(int)l[1].size()&&l[1][j].first<=l[0][i].first){
      cur-=l[1][j].second;
      j++;
    }
    ans=max(ans,cur);
  }
  return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 12136 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '803213453'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10476 KB Output is correct
2 Correct 7 ms 10452 KB Output is correct
3 Correct 20 ms 11232 KB Output is correct
4 Correct 15 ms 11764 KB Output is correct
5 Correct 32 ms 13708 KB Output is correct
6 Correct 31 ms 13680 KB Output is correct
7 Correct 33 ms 13684 KB Output is correct
8 Correct 32 ms 13684 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10476 KB Output is correct
2 Correct 7 ms 10452 KB Output is correct
3 Correct 20 ms 11232 KB Output is correct
4 Correct 15 ms 11764 KB Output is correct
5 Correct 32 ms 13708 KB Output is correct
6 Correct 31 ms 13680 KB Output is correct
7 Correct 33 ms 13684 KB Output is correct
8 Correct 32 ms 13684 KB Output is correct
9 Incorrect 32 ms 13620 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 12136 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '803213453'
2 Halted 0 ms 0 KB -