oj.uz

Submission #626017

# Submission time Handle Problem Language Result Execution time Memory
626017 2022-08-11T06:26:16 Z sword060 Catfish Farm (IOI22_fish) C++17
9 / 100
 120 ms 11472 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
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){
    long long dp[x+1][2];
    for(int i=0;i<x;i++)dp[i][0]=0,dp[i][1]=0;
    for(int i=0;i<k;i++)dp[a[i]][0]+=c[i],dp[a[i]][1]+=c[i];
    dp[0][0]=-1e9;dp[x-1][1]=-1e9;
    for(int i=0;i<x;i++){
      if(i>1)dp[i][1]+=max({0LL,dp[i-1][0],dp[i-2][1]});
      else if(i>0)dp[i][1]+=max(0LL,dp[i-1][0]);
      if(i>2)dp[i][0]+=max({0LL,dp[i-2][0],dp[i-3][1]});
      else if(i>1)dp[i][0]+=max({0LL,dp[i-2][0]});
      ans=max({ans,dp[i][0],dp[i][1]});
    }
    return ans;
  }
  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<l[1].size()&&l[1][j].first<=l[0][i].first){
      cur-=l[1][j].second;
      j++;
    }
    ans=max(ans,cur);
  }
  return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:37:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     while(j<l[1].size()&&l[1][j].first<=l[0][i].first){
      |           ~^~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3320 KB Output is correct
2 Correct 36 ms 3760 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 117 ms 11472 KB Output is correct
6 Correct 120 ms 11472 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 63 ms 5684 KB Output is correct
3 Correct 75 ms 6748 KB Output is correct
4 Correct 29 ms 3292 KB Output is correct
5 Correct 37 ms 3772 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 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 2 ms 1748 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 30 ms 3664 KB Output is correct
13 Correct 39 ms 4192 KB Output is correct
14 Correct 32 ms 3464 KB Output is correct
15 Correct 40 ms 3856 KB Output is correct
16 Correct 33 ms 3524 KB Output is correct
17 Correct 34 ms 3704 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 16 ms 3532 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '18638946193445'
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 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 16 ms 3532 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '18638946193445'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3320 KB Output is correct
2 Correct 36 ms 3760 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 117 ms 11472 KB Output is correct
6 Correct 120 ms 11472 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 63 ms 5684 KB Output is correct
9 Correct 75 ms 6748 KB Output is correct
10 Correct 29 ms 3292 KB Output is correct
11 Correct 37 ms 3772 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 2 ms 1748 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 30 ms 3664 KB Output is correct
19 Correct 39 ms 4192 KB Output is correct
20 Correct 32 ms 3464 KB Output is correct
21 Correct 40 ms 3856 KB Output is correct
22 Correct 33 ms 3524 KB Output is correct
23 Correct 34 ms 3704 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Incorrect 16 ms 3532 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '18638946193445'
27 Halted 0 ms 0 KB -