Submission #626232

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
626232	2022-08-11T10:15:57 Z	sword060	Catfish Farm (IOI22_fish)	C++17	9 / 100	115 ms	11484 KB

fish

#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,1,m);
  if(f)return dp[i][0]=max(z,rec(i+1,0,m)+ar[i]);
  if(i<m-1)return dp[i][1]=max(z,rec(i+2,0,m)+ar[i]);
  return dp[i][1]=z;
}
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);
  }
  if(f){
    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,0,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
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	3300 KB	Output is correct
2	Correct	37 ms	3768 KB	Output is correct
3	Correct	7 ms	10452 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	115 ms	11480 KB	Output is correct
6	Correct	114 ms	11484 KB	Output is correct

Subtask #2
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	59 ms	5692 KB	Output is correct
3	Correct	86 ms	6748 KB	Output is correct
4	Correct	31 ms	3288 KB	Output is correct
5	Correct	35 ms	3780 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	6 ms	10452 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	27 ms	3268 KB	Output is correct
13	Correct	33 ms	3784 KB	Output is correct
14	Correct	44 ms	3088 KB	Output is correct
15	Correct	37 ms	3424 KB	Output is correct
16	Correct	31 ms	3172 KB	Output is correct
17	Correct	35 ms	3396 KB	Output is correct

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	10452 KB	Output is correct
2	Correct	8 ms	10464 KB	Output is correct
3	Incorrect	22 ms	11216 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
4	Halted	0 ms	0 KB	-

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	6 ms	10452 KB	Output is correct
2	Correct	8 ms	10464 KB	Output is correct
3	Incorrect	22 ms	11216 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
4	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	3300 KB	Output is correct
2	Correct	37 ms	3768 KB	Output is correct
3	Correct	7 ms	10452 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	115 ms	11480 KB	Output is correct
6	Correct	114 ms	11484 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	59 ms	5692 KB	Output is correct
9	Correct	86 ms	6748 KB	Output is correct
10	Correct	31 ms	3288 KB	Output is correct
11	Correct	35 ms	3780 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	6 ms	10452 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	27 ms	3268 KB	Output is correct
19	Correct	33 ms	3784 KB	Output is correct
20	Correct	44 ms	3088 KB	Output is correct
21	Correct	37 ms	3424 KB	Output is correct
22	Correct	31 ms	3172 KB	Output is correct
23	Correct	35 ms	3396 KB	Output is correct
24	Correct	6 ms	10452 KB	Output is correct
25	Correct	8 ms	10464 KB	Output is correct
26	Incorrect	22 ms	11216 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
27	Halted	0 ms	0 KB	-

Submission #626232

Compilation message