oj.uz

Submission #629828

# Submission time Handle Problem Language Result Execution time Memory
629828 2022-08-15T08:20:02 Z Vovamatrix Catfish Farm (IOI22_fish) C++17
61 / 100
 1000 ms 23244 KB 
//https://oj.uz/problem/view/IOI22_fish
#include "fish.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define endl "\n"
 
#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define ima_li_te(D,d)  find(all(D),d)
#define MAXN 100007
#define MAXM 300007
ll dp[2][3][MAXN];
ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w)
{
    vector<pair<int,ll>> v[n];
    ll cnt=0;
    for(int i=0;i<m;i++) y[i]++;
    for(int i=0;i<m;i++) v[x[i]].pb(mp(y[i],w[i]));
    for(int i=0;i<n;i++)
    {
        v[i].pb(mp(0,0)); sort(all(v[i])); v[i].pb(mp(n+2,0));
        for(int j=1;j<v[i].size();j++) v[i][j].sc+=v[i][j-1].sc;
    }
    for(int i=0;i<v[1].size();i++)
    {
        ll k=0;
        while(k+1<v[0].size() && v[1][i].fi>v[0][k+1].fi) k++;
        dp[1][2][i]=v[1].back().sc-v[1][max(i-1,0)].sc;
        dp[1][1][i]=v[0][k].sc;
    }
    for(int i=0;i<v[0].size();i++)
    {
        ll k=0;
        while(k+1<v[1].size() && v[0][i].fi>v[1][k+1].fi) k++;
        dp[1][0][i]=v[1][k].sc;
    }
    for(int i=2;i<n;i++)
    {
        for(int j=0;j<3;j++)
        {
            for(int k=0;k<max(v[i-1].size(),v[i].size());k++) dp[i&1][j][k]=0;
        }
        for(int j=0;j<v[i-1].size();j++)
        {
            ll k=0;
            while(k+1<v[i].size() && v[i-1][j].fi>v[i][k+1].fi) k++;
            dp[i&1][0][j]=max(dp[(i&1)^1][1][j],dp[(i&1)^1][2][j])+v[i][k].sc;
        }
        cnt=-1;
        for(int j=0;j<v[i].size();j++)
        {
            ll k=0,l=0,p=0;
            while(k<v[i-2].size() && v[i][j].fi>v[i-2][k].fi)
            {
                while(l<v[i-1].size()-1 && v[i-2][k].fi>v[i-1][l+1].fi) l++;
                cnt=max(cnt,dp[(i&1)^1][0][k]+v[i-1][l].sc);
                k++;
            }
            while(p<v[i-1].size()-1 && v[i][j].fi>v[i-1][p+1].fi) p++;
            dp[i&1][1][j]=max(dp[i&1][1][j],cnt-v[i-1][p].sc);
        }
        cnt=-1;
        for(int j=v[i].size()-1;j>=0;j--)
        {
            ll k=v[i-2].size()-1;
            while(k>=0 && v[i][j].fi<=v[i-2][k].fi)
            {
                cnt=max(cnt,dp[(i&1)^1][0][k]);
                k--;
            }
            dp[i&1][1][j]=max(dp[i&1][1][j],cnt);
        }
        cnt=-1;
        for(int j=0;j<v[i].size();j++)
        {
            ll k=0,l=0;
            while(k<v[i-1].size() && v[i][j].fi>=v[i-1][k].fi)
            {
                cnt=max(cnt, dp[(i&1)^1][1][k]-v[i-1][max(k-1,0ll)].sc);
                k++;
            }
            while(l<v[i-1].size()-1 && v[i][j].fi > v[i-1][l].fi) l++;
            dp[i&1][1][j]=max(dp[i&1][1][j],cnt+v[i-1][max(l-1,0ll)].sc);
        }
        cnt=-1;
        for(int j=v[i].size()-1;j>=0;j--)
        {
            ll k=v[i-1].size()-1,l=v[i].size()-1;
            while(k>=0 && v[i][j].fi<v[i-1][k].fi)
            {
                while(l>0 && v[i-1][k].fi<=v[i][l].fi) l--;
                cnt=max(cnt,max(dp[(i&1)^1][1][k],dp[(i&1)^1][2][k])+v[i][l].sc);
                k--;
            }
            dp[i&1][2][j]=max(dp[i&1][2][j],cnt-v[i][max(j-1,0)].sc);
        }
    }
    ll rez=0;
    for(int i=0;i<v[n-2].size();i++) rez=max(rez,dp[(n-1)&1][0][i]);
    for(int i=1;i<3;i++)
    {
        for(int j=0;j<v[n-1].size();j++) rez=max(rez,dp[(n-1)&1][i][j]);
    }
    return rez;
}

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:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for(int j=1;j<v[i].size();j++) v[i][j].sc+=v[i][j-1].sc;
      |                     ~^~~~~~~~~~~~
fish.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<v[1].size();i++)
      |                 ~^~~~~~~~~~~~
fish.cpp:42:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         while(k+1<v[0].size() && v[1][i].fi>v[0][k+1].fi) k++;
      |               ~~~^~~~~~~~~~~~
fish.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0;i<v[0].size();i++)
      |                 ~^~~~~~~~~~~~
fish.cpp:49:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         while(k+1<v[1].size() && v[0][i].fi>v[1][k+1].fi) k++;
      |               ~~~^~~~~~~~~~~~
fish.cpp:56:26: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   56 |             for(int k=0;k<max(v[i-1].size(),v[i].size());k++) dp[i&1][j][k]=0;
      |                         ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for(int j=0;j<v[i-1].size();j++)
      |                     ~^~~~~~~~~~~~~~
fish.cpp:61:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             while(k+1<v[i].size() && v[i-1][j].fi>v[i][k+1].fi) k++;
      |                   ~~~^~~~~~~~~~~~
fish.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for(int j=0;j<v[i].size();j++)
      |                     ~^~~~~~~~~~~~
fish.cpp:68:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             while(k<v[i-2].size() && v[i][j].fi>v[i-2][k].fi)
      |                   ~^~~~~~~~~~~~~~
fish.cpp:70:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |                 while(l<v[i-1].size()-1 && v[i-2][k].fi>v[i-1][l+1].fi) l++;
      |                       ~^~~~~~~~~~~~~~~~
fish.cpp:74:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             while(p<v[i-1].size()-1 && v[i][j].fi>v[i-1][p+1].fi) p++;
      |                   ~^~~~~~~~~~~~~~~~
fish.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int j=0;j<v[i].size();j++)
      |                     ~^~~~~~~~~~~~
fish.cpp:92:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             while(k<v[i-1].size() && v[i][j].fi>=v[i-1][k].fi)
      |                   ~^~~~~~~~~~~~~~
fish.cpp:97:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |             while(l<v[i-1].size()-1 && v[i][j].fi > v[i-1][l].fi) l++;
      |                   ~^~~~~~~~~~~~~~~~
fish.cpp:114:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for(int i=0;i<v[n-2].size();i++) rez=max(rez,dp[(n-1)&1][0][i]);
      |                 ~^~~~~~~~~~~~~~
fish.cpp:117:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for(int j=0;j<v[n-1].size();j++) rez=max(rez,dp[(n-1)&1][i][j]);
      |                     ~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10428 KB Output is correct
2 Correct 55 ms 11964 KB Output is correct
3 Correct 16 ms 7252 KB Output is correct
4 Correct 17 ms 7372 KB Output is correct
5 Correct 142 ms 23244 KB Output is correct
6 Correct 188 ms 21736 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7252 KB Output is correct
2 Correct 16 ms 7380 KB Output is correct
3 Correct 37 ms 10048 KB Output is correct
4 Correct 31 ms 9568 KB Output is correct
5 Correct 73 ms 13572 KB Output is correct
6 Correct 54 ms 13516 KB Output is correct
7 Correct 58 ms 13516 KB Output is correct
8 Correct 61 ms 13532 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 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 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 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 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 83 ms 3132 KB Output is correct
18 Correct 84 ms 3692 KB Output is correct
19 Correct 45 ms 3540 KB Output is correct
20 Correct 48 ms 3540 KB Output is correct
21 Correct 48 ms 3516 KB Output is correct
22 Correct 155 ms 6724 KB Output is correct
23 Correct 6 ms 1104 KB Output is correct
24 Correct 37 ms 2240 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 932 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 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 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 83 ms 3132 KB Output is correct
18 Correct 84 ms 3692 KB Output is correct
19 Correct 45 ms 3540 KB Output is correct
20 Correct 48 ms 3540 KB Output is correct
21 Correct 48 ms 3516 KB Output is correct
22 Correct 155 ms 6724 KB Output is correct
23 Correct 6 ms 1104 KB Output is correct
24 Correct 37 ms 2240 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 932 KB Output is correct
27 Correct 2 ms 632 KB Output is correct
28 Correct 867 ms 11352 KB Output is correct
29 Execution timed out 1094 ms 14772 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7252 KB Output is correct
2 Correct 16 ms 7380 KB Output is correct
3 Correct 37 ms 10048 KB Output is correct
4 Correct 31 ms 9568 KB Output is correct
5 Correct 73 ms 13572 KB Output is correct
6 Correct 54 ms 13516 KB Output is correct
7 Correct 58 ms 13516 KB Output is correct
8 Correct 61 ms 13532 KB Output is correct
9 Correct 60 ms 13464 KB Output is correct
10 Correct 47 ms 8404 KB Output is correct
11 Correct 96 ms 16356 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 20 ms 7320 KB Output is correct
19 Correct 16 ms 7368 KB Output is correct
20 Correct 17 ms 7380 KB Output is correct
21 Correct 16 ms 7252 KB Output is correct
22 Correct 72 ms 12108 KB Output is correct
23 Correct 115 ms 16348 KB Output is correct
24 Correct 106 ms 16304 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10428 KB Output is correct
2 Correct 55 ms 11964 KB Output is correct
3 Correct 16 ms 7252 KB Output is correct
4 Correct 17 ms 7372 KB Output is correct
5 Correct 142 ms 23244 KB Output is correct
6 Correct 188 ms 21736 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Execution timed out 1100 ms 14028 KB Time limit exceeded
9 Halted 0 ms 0 KB -