oj.uz

답안 #1076300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076300 2024-08-26T12:40:47 Z Faisal_Saqib 메기 농장 (IOI22_fish) C++17
53 / 100
 290 ms 88224 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
const int N=1e5+10;
vll pre[N];
ll sz[N];
vll dp[N][3];
vll possible[N];
vector<pair<ll,ll>> values[N];
ll solve(ll&n,ll&m,vll&x,vll&y,vll&w)
{
    ll ans=0;
    for(int j=0;j<m;j++)
    {
        values[x[j]].push_back({y[j]+1,w[j]});
        possible[x[j]].push_back(y[j]+1);
        possible[x[j]+1].push_back(y[j]+1);
        if(x[j]>0)
            possible[x[j]-1].push_back(y[j]+1);
        // cout<<"AT "<<x[j]<<' '<<y[j]+1<<endl;
    }
    for(int i=0;i<=n;i++)
    {
        possible[i].push_back(0);
        possible[i].push_back(n);
        sort(begin(possible[i]),end(possible[i]));
        sort(begin(values[i]),end(values[i]));
        sz[i]=possible[i].size();
        pre[i].resize(sz[i]+1,0);
        ll sm=0;
        int pp=0;
        int rp=0;
        for(auto&j:possible[i])
        {
            while(pp<values[i].size() and values[i][pp].first<=j)
            {
                sm+=values[i][pp].second;
                pp++;
            }
            pre[i][rp]=sm;
            rp++;
        }
        dp[i][0].resize(sz[i]+1,0);
        dp[i][1].resize(sz[i]+1,0);
    }
    for(int i=1;i<n;i++)
    {
        // ll sum=0;
        ll mx1=-1e18;
        ll mx2=-1e18;
        ll mx11=0,mx22=0;
        for(int k=0;k<sz[i-1];k++)
        {
            int hp=possible[i-1][k];
            mx11=max(mx11,dp[i-1][0][k]);
            mx1=max(mx1,dp[i-1][0][k]-pre[i-1][k]);
        }
        for(int k=0;k<sz[i-1];k++)
        {
            int hp=possible[i-1][k];
            mx22=max(mx22,dp[i-1][1][k]);
            auto index=lower_bound(all(possible[i]),hp);
            if(index!=end(possible[i]))
            {
                int ind=index-begin(possible[i]);
                mx2=max(mx2,dp[i-1][1][k]+pre[i][ind]);
            }
        }
        // cout<<"For "<<i<<' '<<mx1<<' '<<mx2<<' '<<mx11<<' '<<mx22<<endl;
        int pp=0;
        for(auto&h:possible[i])
        {
            auto index=lower_bound(all(possible[i-1]),h);
            // if(possible[i-1][index]!=h)
            // {
            //     cout<<"Fudge\n";
            //     cout<<i-1<<' '<<index<<' '<<h<<endl;
            //     for(auto jp:possible[i-1])
            //     {
            //         cout<<jp<<' ';
            //     }
            //     cout<<endl;
            // }
            if(index!=end(possible[i-1]))
            {
                int ind=index-begin(possible[i-1]);
                dp[i][0][pp]=max(dp[i][0][pp],mx1+pre[i-1][ind]);
                dp[i][1][pp]=max(dp[i][1][pp],mx1+pre[i-1][ind]);
            }
            // else
            // {
            //     dp[i][0][pp]=max(dp[i][0][pp],mx1);
            //     dp[i][1][pp]=max(dp[i][1][pp],mx1);
            // }
            dp[i][1][pp]=max(dp[i][1][pp],mx2-pre[i][pp]);

            dp[i][0][pp]=max(dp[i][0][pp],mx11);
            dp[i][0][pp]=max(dp[i][0][pp],mx22);

            dp[i][1][pp]=max(dp[i][1][pp],mx11);
            dp[i][1][pp]=max(dp[i][1][pp],mx22);
            pp++;
        }
    }
    // cout<<"Then\n";
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<sz[i];j++)
        {
            ans=max(ans,dp[i][0][j]);
            ans=max(ans,dp[i][1][j]);
            // cout<<i<<' '<<possible[i][j]<<' '<<0<<' '<<dp[i][0][j]<<endl;
            // cout<<i<<' '<<possible[i][j]<<' '<<1<<' '<<dp[i][1][j]<<endl;
        }
    }
    return ans;
}
// long long max_weights(int N, int M, std::vector<ll> X, std::vector<ll> Y,std::vector<ll> W)
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W)
{
    ll n=N,m=M,ans=0;
    vector<ll> x(all(X)),y(all(Y)),w(all(W));
    return solve(n,m,x,y,w);
}

Compilation message

fish.cpp: In function 'long long int solve(long long int&, long long int&, std::vector<long long int>&, std::vector<long long int>&, std::vector<long long int>&)':
fish.cpp:37:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             while(pp<values[i].size() and values[i][pp].first<=j)
      |                   ~~^~~~~~~~~~~~~~~~~
fish.cpp:56:17: warning: unused variable 'hp' [-Wunused-variable]
   56 |             int hp=possible[i-1][k];
      |                 ^~
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:123:16: warning: unused variable 'ans' [-Wunused-variable]
  123 |     ll n=N,m=M,ans=0;
      |                ^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 37828 KB Output is correct
2 Correct 83 ms 41920 KB Output is correct
3 Correct 28 ms 27736 KB Output is correct
4 Correct 30 ms 27728 KB Output is correct
5 Correct 254 ms 81912 KB Output is correct
6 Correct 290 ms 88224 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 136 ms 52116 KB Output is correct
3 Correct 165 ms 59380 KB Output is correct
4 Correct 72 ms 37824 KB Output is correct
5 Correct 84 ms 41916 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 7 ms 14536 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 40 ms 27728 KB Output is correct
11 Correct 30 ms 27728 KB Output is correct
12 Correct 85 ms 40784 KB Output is correct
13 Correct 101 ms 45296 KB Output is correct
14 Correct 90 ms 39400 KB Output is correct
15 Correct 91 ms 42072 KB Output is correct
16 Correct 78 ms 39148 KB Output is correct
17 Correct 85 ms 41896 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 27736 KB Output is correct
2 Correct 29 ms 27736 KB Output is correct
3 Correct 62 ms 38736 KB Output is correct
4 Correct 48 ms 36436 KB Output is correct
5 Correct 121 ms 52688 KB Output is correct
6 Correct 92 ms 51796 KB Output is correct
7 Correct 94 ms 52564 KB Output is correct
8 Correct 98 ms 52564 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 8 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 8 ms 14940 KB Output is correct
11 Correct 8 ms 14684 KB Output is correct
12 Correct 7 ms 14684 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 7 ms 14684 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 8 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 8 ms 14940 KB Output is correct
11 Correct 8 ms 14684 KB Output is correct
12 Correct 7 ms 14684 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 7 ms 14684 KB Output is correct
15 Correct 9 ms 14424 KB Output is correct
16 Correct 8 ms 14940 KB Output is correct
17 Correct 35 ms 22876 KB Output is correct
18 Correct 34 ms 23388 KB Output is correct
19 Correct 34 ms 23144 KB Output is correct
20 Correct 29 ms 23124 KB Output is correct
21 Correct 27 ms 23132 KB Output is correct
22 Correct 56 ms 31828 KB Output is correct
23 Correct 12 ms 16340 KB Output is correct
24 Correct 24 ms 20568 KB Output is correct
25 Correct 8 ms 14812 KB Output is correct
26 Correct 11 ms 16204 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 8 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 8 ms 14940 KB Output is correct
11 Correct 8 ms 14684 KB Output is correct
12 Correct 7 ms 14684 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 7 ms 14684 KB Output is correct
15 Correct 9 ms 14424 KB Output is correct
16 Correct 8 ms 14940 KB Output is correct
17 Correct 35 ms 22876 KB Output is correct
18 Correct 34 ms 23388 KB Output is correct
19 Correct 34 ms 23144 KB Output is correct
20 Correct 29 ms 23124 KB Output is correct
21 Correct 27 ms 23132 KB Output is correct
22 Correct 56 ms 31828 KB Output is correct
23 Correct 12 ms 16340 KB Output is correct
24 Correct 24 ms 20568 KB Output is correct
25 Correct 8 ms 14812 KB Output is correct
26 Correct 11 ms 16204 KB Output is correct
27 Correct 10 ms 15452 KB Output is correct
28 Correct 158 ms 55328 KB Output is correct
29 Correct 232 ms 70992 KB Output is correct
30 Incorrect 186 ms 75032 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102440153599307'
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 27736 KB Output is correct
2 Correct 29 ms 27736 KB Output is correct
3 Correct 62 ms 38736 KB Output is correct
4 Correct 48 ms 36436 KB Output is correct
5 Correct 121 ms 52688 KB Output is correct
6 Correct 92 ms 51796 KB Output is correct
7 Correct 94 ms 52564 KB Output is correct
8 Correct 98 ms 52564 KB Output is correct
9 Correct 102 ms 52296 KB Output is correct
10 Correct 69 ms 39620 KB Output is correct
11 Correct 146 ms 64860 KB Output is correct
12 Correct 7 ms 14424 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 5 ms 14428 KB Output is correct
16 Correct 7 ms 14676 KB Output is correct
17 Correct 7 ms 14428 KB Output is correct
18 Correct 28 ms 27596 KB Output is correct
19 Correct 29 ms 27736 KB Output is correct
20 Correct 28 ms 27728 KB Output is correct
21 Correct 27 ms 27740 KB Output is correct
22 Correct 117 ms 49500 KB Output is correct
23 Incorrect 161 ms 64872 KB 1st lines differ - on the 1st token, expected: '77772396150817', found: '77782926777237'
24 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 37828 KB Output is correct
2 Correct 83 ms 41920 KB Output is correct
3 Correct 28 ms 27736 KB Output is correct
4 Correct 30 ms 27728 KB Output is correct
5 Correct 254 ms 81912 KB Output is correct
6 Correct 290 ms 88224 KB Output is correct
7 Correct 6 ms 14424 KB Output is correct
8 Correct 136 ms 52116 KB Output is correct
9 Correct 165 ms 59380 KB Output is correct
10 Correct 72 ms 37824 KB Output is correct
11 Correct 84 ms 41916 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 7 ms 14536 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 40 ms 27728 KB Output is correct
17 Correct 30 ms 27728 KB Output is correct
18 Correct 85 ms 40784 KB Output is correct
19 Correct 101 ms 45296 KB Output is correct
20 Correct 90 ms 39400 KB Output is correct
21 Correct 91 ms 42072 KB Output is correct
22 Correct 78 ms 39148 KB Output is correct
23 Correct 85 ms 41896 KB Output is correct
24 Correct 28 ms 27736 KB Output is correct
25 Correct 29 ms 27736 KB Output is correct
26 Correct 62 ms 38736 KB Output is correct
27 Correct 48 ms 36436 KB Output is correct
28 Correct 121 ms 52688 KB Output is correct
29 Correct 92 ms 51796 KB Output is correct
30 Correct 94 ms 52564 KB Output is correct
31 Correct 98 ms 52564 KB Output is correct
32 Correct 7 ms 14428 KB Output is correct
33 Correct 6 ms 14428 KB Output is correct
34 Correct 8 ms 14428 KB Output is correct
35 Correct 6 ms 14428 KB Output is correct
36 Correct 7 ms 14428 KB Output is correct
37 Correct 6 ms 14428 KB Output is correct
38 Correct 7 ms 14428 KB Output is correct
39 Correct 7 ms 14428 KB Output is correct
40 Correct 7 ms 14428 KB Output is correct
41 Correct 8 ms 14940 KB Output is correct
42 Correct 8 ms 14684 KB Output is correct
43 Correct 7 ms 14684 KB Output is correct
44 Correct 6 ms 14428 KB Output is correct
45 Correct 7 ms 14684 KB Output is correct
46 Correct 9 ms 14424 KB Output is correct
47 Correct 8 ms 14940 KB Output is correct
48 Correct 35 ms 22876 KB Output is correct
49 Correct 34 ms 23388 KB Output is correct
50 Correct 34 ms 23144 KB Output is correct
51 Correct 29 ms 23124 KB Output is correct
52 Correct 27 ms 23132 KB Output is correct
53 Correct 56 ms 31828 KB Output is correct
54 Correct 12 ms 16340 KB Output is correct
55 Correct 24 ms 20568 KB Output is correct
56 Correct 8 ms 14812 KB Output is correct
57 Correct 11 ms 16204 KB Output is correct
58 Correct 10 ms 15452 KB Output is correct
59 Correct 158 ms 55328 KB Output is correct
60 Correct 232 ms 70992 KB Output is correct
61 Incorrect 186 ms 75032 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102440153599307'
62 Halted 0 ms 0 KB -