제출 #626017

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626017		sword060	Catfish Farm (IOI22_fish)	C++17	9 / 100	120 ms	11472 KiB

fish

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 3
• Subtask 2: 6 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16