Submission #630811

#TimeUsernameProblemLanguageResultExecution timeMemory
630811TimDee메기 농장 (IOI22_fish)C++17
9 / 100
91 ms8028 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


ll p2(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  vector<int> a(n,0), b(n,0);
  ll sum=0;
  for (int i=0; i<m; ++i) {
    if (x[i]==0) a[y[i]]=w[i];
    else b[y[i]]=w[i];
    sum+=w[i];
  }
  ll ans=0;
  for (int i=0; i<n; ++i) ans+=b[i];
  if (n==2) return max(ans,sum-ans);
  ll cnt=ans;
  for (int i=0; i<n; ++i) {
    cnt+=1ll*a[i]-1ll*b[i];
    ans=max(ans,cnt);
  }
  return ans;

}

ll p3(int n, int m, vector<int> x, vector<int> w) {

  vector<int> a(n,0);
  for (int i=0; i<m; ++i) a[x[i]]=w[i];
  vector<vector<int>> dp(n+1,vector<int>(2,0));
  dp[1]={a[1],0};
  for (int i=2; i<=n; ++i) {
    dp[i] = {dp[i-2][1]+a[i]+a[i-2], max(dp[i-1][0],dp[i-1][1])};
  }

  return max(dp[n][0],dp[n][1]);

}

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  int _p1=1, _p2=1, _p3=1;
  ll sum=0;
  for (int i=0; i<m; ++i) {
    _p1&=!(x[i]&1);
    _p2&=(x[i]<=1);
    _p3&=(y[i]==0);
    sum+=w[i];
  }

  if (_p1) return sum;
  if (_p2) return p2(n,m,x,y,w);
  if (_p3) return p3(n,m,x,w);

}

Compilation message (stderr)

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...