oj.uz

Submission #1079045

# Submission time Handle Problem Language Result Execution time Memory
1079045 2024-08-28T09:56:41 Z LittleOrange Catfish Farm (IOI22_fish) C++17
9 / 100
 1000 ms 43864 KB 
#include "fish.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll big = 1e18;

long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,
                      std::vector<int> w) {
  ll sub1 = 1, sub2 = 1, sub3 = 1;
  vector<vector<pair<ll,ll>>> a(n+1);
  vector<vector<ll>> b(n+1,vector<ll>(1,-1));
  for(ll i = 0;i<m;i++){
    a[x[i]].push_back({y[i],w[i]});
    if(x[i]) b[x[i]-1].push_back(y[i]);
    b[x[i]+1].push_back(y[i]);
    b[x[i]].push_back(y[i]);
    if(x[i]&1) sub1 = 0;
    if(x[i]>1) sub2 = 0;
    if(y[i]) sub3 = 0;
  }
  //cerr << sub1 << " " << sub2 << " " << sub3 << "\n";
  for(auto &o : a) sort(o.begin(),o.end());
  for(auto &o : b) sort(o.begin(),o.end());
  vector<vector<ll>> dp = b;
  for(auto &o : dp)fill(o.begin(),o.end(),0);
  vector<vector<ll>> dp0 = dp;
  for(auto &o : a){
    for(ll i = 1;i<o.size();i++){
      o[i].second += o[i-1].second;
    }
  }
  //for(auto &o : b){
  //  for(ll i = 0;i<o.size();i++) cout << o[i] << " \n"[i+1==o.size()];
  //}
  auto qry = [&](ll i, ll l, ll r){
    auto &o = a[i];
    auto v1 = lower_bound(o.begin(),o.end(),make_pair(l+1,0ll));
    auto v2 = lower_bound(o.begin(),o.end(),make_pair(r+1,0ll));
    ll g1 = v1==o.begin()?0:(*--v1).second;
    ll g2 = v2==o.begin()?0:(*--v2).second;
    //cerr << "qry " << i << " " << l << " " << r << " = " << g2-g1 << "\n";
    return g2-g1;
  };
  ll ans = 0;
  for(ll i = 1;i<n;i++){
    for(ll j = 0;j<b[i].size();j++){
      ll y = b[i][j];
      for(ll k = 0;k<b[i-1].size();k++){
        ll y0 = b[i-1][k];
        ll cur = dp0[i-1][k];
        if(y0<y) cur += qry(i-1,y0,y);
        dp0[i][j] = max(dp0[i][j],cur);
        if(y0>y) cur += qry(i,y,y0);
        dp[i][j] = max(dp[i][j],cur);
      }
      if(i>1)for(ll k = 0;k<b[i-2].size();k++){
        ll y0 = b[i-2][k];
        ll cur = dp[i-2][k];
        ll h = max(y,y0);
        cur += qry(i-1,-1,h);
        dp[i][j] = max(dp[i][j],cur);
        dp0[i][j] = max(dp0[i][j],cur);
      }
      if(i>2)for(ll k = 0;k<b[i-3].size();k++){
        ll y0 = b[i-3][k];
        ll cur = dp[i-3][k];
        cur += qry(i-2,-1,y0);
        cur += qry(i-1,-1,y);
        dp[i][j] = max(dp[i][j],cur);
        dp0[i][j] = max(dp0[i][j],cur);
      }
      ans = max(ans,dp[i][j]);
      ans = max(ans,dp0[i][j]);
      //cerr << "dp " << i << " " << j << " = " << dp[i][j] << "\n";
    }
  }
  return ans;
  if (sub1){
    ll ans = 0;
    for(ll i : w) ans += i;
    return ans;
  }
  if(sub2){
    ll a1 = 0, a2 = 0;
    vector<array<ll,3>> o;
    for(auto [p,v] : a[0]) a1+=v,o.push_back({p,1,v});
    for(auto [p,v] : a[1]) a2+=v,o.push_back({p,0,v});
    ll ans = max(a1,a2);
    if(n>2){
      sort(o.begin(),o.end());
      ll dp0 = 0, dp1 = 0;
      for(auto &u : o){
        if (u[1]){
          dp0 += u[2];
          dp1 = max(dp1,dp0);
        }else{
          dp1 += u[2];
        }
      }
      ans = max(ans,dp1);
    }
    return ans;
  }
  if (sub3){
    ll ans = 0;
    for(ll i : w) ans += i;
    vector<ll> dp(n+1,big);
    dp[0] = 0;
    for(ll i = 0;i<n;i++){
      ll cur = a[i].size()?a[i][0].second:0;
      dp[i+1] = min(dp[i+1],dp[i]+cur);
      if(i>=1)dp[i+1] = min(dp[i+1],dp[i-1]+cur);
      if(i>=3)dp[i+1] = min(dp[i+1],dp[i-2]+cur);
    }
    //for(ll i = 0;i<=n;i++) cerr << dp[i] << " \n"[i==n];
    ll de = min(dp.back(),dp.end()[-2]);
    return ans-de;
  }
  return 0;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:30:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(ll i = 1;i<o.size();i++){
      |                  ~^~~~~~~~~
fish.cpp:48:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(ll j = 0;j<b[i].size();j++){
      |                  ~^~~~~~~~~~~~
fish.cpp:50:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |       for(ll k = 0;k<b[i-1].size();k++){
      |                    ~^~~~~~~~~~~~~~
fish.cpp:58:28: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |       if(i>1)for(ll k = 0;k<b[i-2].size();k++){
      |                           ~^~~~~~~~~~~~~~
fish.cpp:66:28: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |       if(i>2)for(ll k = 0;k<b[i-3].size();k++){
      |                           ~^~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 25648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 1098 ms 35800 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 19036 KB Output is correct
2 Correct 21 ms 19036 KB Output is correct
3 Correct 59 ms 23388 KB Output is correct
4 Correct 89 ms 23292 KB Output is correct
5 Correct 121 ms 31060 KB Output is correct
6 Correct 108 ms 30468 KB Output is correct
7 Correct 124 ms 31060 KB Output is correct
8 Correct 140 ms 31056 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 19036 KB Output is correct
2 Correct 21 ms 19036 KB Output is correct
3 Correct 59 ms 23388 KB Output is correct
4 Correct 89 ms 23292 KB Output is correct
5 Correct 121 ms 31060 KB Output is correct
6 Correct 108 ms 30468 KB Output is correct
7 Correct 124 ms 31060 KB Output is correct
8 Correct 140 ms 31056 KB Output is correct
9 Correct 139 ms 30804 KB Output is correct
10 Correct 163 ms 22068 KB Output is correct
11 Correct 332 ms 43864 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
18 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 25648 KB Time limit exceeded
2 Halted 0 ms 0 KB -