oj.uz

답안 #1079450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079450 2024-08-28T14:54:26 Z LittleOrange 메기 농장 (IOI22_fish) C++17
32 / 100
 1000 ms 2097152 KB 
#include "fish.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll big = 1e18;
#define qry(i,l,r) (((i)<0||(i)>=n)?0:((r)>=0?preq[(i)][(r)]:0)-((l)>=0?preq[(i)][(l)]:0))
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());
  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;
  }
  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()];
  //}
  vector<vector<ll>> preq(n,vector<ll>(n+5,0));
  for(ll i = 0;i<n;i++){
    for(auto [p,v] : a[i]){
      preq[i][p] = v;
    }
    for(ll j = 1;j<n+5;j++){
      preq[i][j] = max(preq[i][j],preq[i][j-1]);
    }
  }
  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 = b[i-2].size()-1;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]+qry(i+1,-1,y));
      ans = max(ans,dp0[i][j]+qry(i+1,-1,y));
      //cerr << "dp " << i << " " << j << " = " << dp[i][j] << "\n";
    }
  }
  return ans;
  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:71: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]
   71 |     for(ll i = 1;i<o.size();i++){
      |                  ~^~~~~~~~~
fish.cpp:89: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]
   89 |     for(ll j = 0;j<b[i].size();j++){
      |                  ~^~~~~~~~~~~~
fish.cpp:91: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]
   91 |       for(ll k = 0;k<b[i-1].size();k++){
      |                    ~^~~~~~~~~~~~~~
fish.cpp:99:42: 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]
   99 |       if(i>1)for(ll k = b[i-2].size()-1;k<b[i-2].size();k++){
      |                                         ~^~~~~~~~~~~~~~
fish.cpp:107: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]
  107 |       if(i>2)for(ll k = 0;k<b[i-3].size();k++){
      |                           ~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 13620 KB Output is correct
2 Correct 47 ms 15160 KB Output is correct
3 Correct 8 ms 8024 KB Output is correct
4 Correct 9 ms 8116 KB Output is correct
5 Correct 147 ms 32988 KB Output is correct
6 Correct 139 ms 37100 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 102 ms 27344 KB Output is correct
3 Correct 124 ms 31732 KB Output is correct
4 Correct 38 ms 13616 KB Output is correct
5 Correct 45 ms 15156 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 7 ms 8028 KB Output is correct
11 Correct 8 ms 8048 KB Output is correct
12 Correct 51 ms 18116 KB Output is correct
13 Correct 58 ms 20300 KB Output is correct
14 Correct 44 ms 17032 KB Output is correct
15 Correct 55 ms 19480 KB Output is correct
16 Correct 45 ms 17808 KB Output is correct
17 Correct 52 ms 18360 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8024 KB Output is correct
2 Correct 7 ms 9052 KB Output is correct
3 Correct 30 ms 12884 KB Output is correct
4 Correct 21 ms 12088 KB Output is correct
5 Correct 51 ms 17232 KB Output is correct
6 Correct 45 ms 16976 KB Output is correct
7 Correct 47 ms 17228 KB Output is correct
8 Correct 51 ms 17232 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 6 ms 604 KB Output is correct
17 Correct 513 ms 7528 KB Output is correct
18 Correct 600 ms 7764 KB Output is correct
19 Correct 357 ms 7540 KB Output is correct
20 Correct 354 ms 7768 KB Output is correct
21 Correct 359 ms 7744 KB Output is correct
22 Execution timed out 1043 ms 13840 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 6 ms 604 KB Output is correct
17 Correct 513 ms 7528 KB Output is correct
18 Correct 600 ms 7764 KB Output is correct
19 Correct 357 ms 7540 KB Output is correct
20 Correct 354 ms 7768 KB Output is correct
21 Correct 359 ms 7744 KB Output is correct
22 Execution timed out 1043 ms 13840 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8024 KB Output is correct
2 Correct 7 ms 9052 KB Output is correct
3 Correct 30 ms 12884 KB Output is correct
4 Correct 21 ms 12088 KB Output is correct
5 Correct 51 ms 17232 KB Output is correct
6 Correct 45 ms 16976 KB Output is correct
7 Correct 47 ms 17228 KB Output is correct
8 Correct 51 ms 17232 KB Output is correct
9 Runtime error 866 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 13620 KB Output is correct
2 Correct 47 ms 15160 KB Output is correct
3 Correct 8 ms 8024 KB Output is correct
4 Correct 9 ms 8116 KB Output is correct
5 Correct 147 ms 32988 KB Output is correct
6 Correct 139 ms 37100 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 102 ms 27344 KB Output is correct
9 Correct 124 ms 31732 KB Output is correct
10 Correct 38 ms 13616 KB Output is correct
11 Correct 45 ms 15156 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 7 ms 8028 KB Output is correct
17 Correct 8 ms 8048 KB Output is correct
18 Correct 51 ms 18116 KB Output is correct
19 Correct 58 ms 20300 KB Output is correct
20 Correct 44 ms 17032 KB Output is correct
21 Correct 55 ms 19480 KB Output is correct
22 Correct 45 ms 17808 KB Output is correct
23 Correct 52 ms 18360 KB Output is correct
24 Correct 8 ms 8024 KB Output is correct
25 Correct 7 ms 9052 KB Output is correct
26 Correct 30 ms 12884 KB Output is correct
27 Correct 21 ms 12088 KB Output is correct
28 Correct 51 ms 17232 KB Output is correct
29 Correct 45 ms 16976 KB Output is correct
30 Correct 47 ms 17228 KB Output is correct
31 Correct 51 ms 17232 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 3 ms 1372 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 2 ms 1372 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 6 ms 604 KB Output is correct
48 Correct 513 ms 7528 KB Output is correct
49 Correct 600 ms 7764 KB Output is correct
50 Correct 357 ms 7540 KB Output is correct
51 Correct 354 ms 7768 KB Output is correct
52 Correct 359 ms 7744 KB Output is correct
53 Execution timed out 1043 ms 13840 KB Time limit exceeded
54 Halted 0 ms 0 KB -