oj.uz

답안 #1076285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076285 2024-08-26T12:33:58 Z Faisal_Saqib 메기 농장 (IOI22_fish) C++17
53 / 100
 256 ms 81748 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=-2e18;
        ll mx2=-2e18;
        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]);
            }
            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:118:16: warning: unused variable 'ans' [-Wunused-variable]
  118 |     ll n=N,m=M,ans=0;
      |                ^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 36548 KB Output is correct
2 Correct 83 ms 40152 KB Output is correct
3 Correct 27 ms 27736 KB Output is correct
4 Correct 29 ms 27992 KB Output is correct
5 Correct 231 ms 76112 KB Output is correct
6 Correct 256 ms 81748 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14428 KB Output is correct
2 Correct 128 ms 49280 KB Output is correct
3 Correct 156 ms 56024 KB Output is correct
4 Correct 71 ms 36464 KB Output is correct
5 Correct 80 ms 40128 KB Output is correct
6 Correct 7 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 6 ms 14436 KB Output is correct
10 Correct 36 ms 27792 KB Output is correct
11 Correct 28 ms 27712 KB Output is correct
12 Correct 81 ms 39616 KB Output is correct
13 Correct 97 ms 43716 KB Output is correct
14 Correct 76 ms 37868 KB Output is correct
15 Correct 85 ms 40444 KB Output is correct
16 Correct 83 ms 37920 KB Output is correct
17 Correct 90 ms 40360 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 27740 KB Output is correct
2 Correct 28 ms 27740 KB Output is correct
3 Correct 56 ms 37888 KB Output is correct
4 Correct 50 ms 35664 KB Output is correct
5 Correct 98 ms 51052 KB Output is correct
6 Correct 86 ms 51028 KB Output is correct
7 Correct 85 ms 51024 KB Output is correct
8 Correct 88 ms 51028 KB Output is correct

Subtask #4
14.0 / 14.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 6 ms 14428 KB Output is correct
6 Correct 6 ms 14532 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 5 ms 14380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14816 KB Output is correct
11 Correct 7 ms 14588 KB Output is correct
12 Correct 6 ms 14684 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 7 ms 14680 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 6 ms 14684 KB Output is correct
17 Correct 34 ms 22192 KB Output is correct
18 Correct 37 ms 22504 KB Output is correct
19 Correct 29 ms 22364 KB Output is correct
20 Correct 29 ms 22284 KB Output is correct
21 Correct 27 ms 22364 KB Output is correct
22 Correct 51 ms 30292 KB Output is correct
23 Correct 10 ms 16216 KB Output is correct
24 Correct 23 ms 20060 KB Output is correct
25 Correct 7 ms 14680 KB Output is correct
26 Correct 11 ms 15964 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 6 ms 14428 KB Output is correct
6 Correct 6 ms 14532 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 5 ms 14380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14816 KB Output is correct
11 Correct 7 ms 14588 KB Output is correct
12 Correct 6 ms 14684 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 7 ms 14680 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 6 ms 14684 KB Output is correct
17 Correct 34 ms 22192 KB Output is correct
18 Correct 37 ms 22504 KB Output is correct
19 Correct 29 ms 22364 KB Output is correct
20 Correct 29 ms 22284 KB Output is correct
21 Correct 27 ms 22364 KB Output is correct
22 Correct 51 ms 30292 KB Output is correct
23 Correct 10 ms 16216 KB Output is correct
24 Correct 23 ms 20060 KB Output is correct
25 Correct 7 ms 14680 KB Output is correct
26 Correct 11 ms 15964 KB Output is correct
27 Correct 8 ms 15448 KB Output is correct
28 Correct 148 ms 51620 KB Output is correct
29 Correct 221 ms 65360 KB Output is correct
30 Incorrect 172 ms 69712 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 27740 KB Output is correct
2 Correct 28 ms 27740 KB Output is correct
3 Correct 56 ms 37888 KB Output is correct
4 Correct 50 ms 35664 KB Output is correct
5 Correct 98 ms 51052 KB Output is correct
6 Correct 86 ms 51028 KB Output is correct
7 Correct 85 ms 51024 KB Output is correct
8 Correct 88 ms 51028 KB Output is correct
9 Correct 95 ms 51048 KB Output is correct
10 Correct 67 ms 37972 KB Output is correct
11 Correct 145 ms 61308 KB Output is correct
12 Correct 7 ms 14428 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 5 ms 14428 KB Output is correct
18 Correct 35 ms 27752 KB Output is correct
19 Correct 27 ms 27736 KB Output is correct
20 Correct 29 ms 27632 KB Output is correct
21 Correct 27 ms 27828 KB Output is correct
22 Correct 93 ms 47336 KB Output is correct
23 Incorrect 142 ms 61520 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 68 ms 36548 KB Output is correct
2 Correct 83 ms 40152 KB Output is correct
3 Correct 27 ms 27736 KB Output is correct
4 Correct 29 ms 27992 KB Output is correct
5 Correct 231 ms 76112 KB Output is correct
6 Correct 256 ms 81748 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 128 ms 49280 KB Output is correct
9 Correct 156 ms 56024 KB Output is correct
10 Correct 71 ms 36464 KB Output is correct
11 Correct 80 ms 40128 KB Output is correct
12 Correct 7 ms 14428 KB Output is correct
13 Correct 6 ms 14428 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 6 ms 14436 KB Output is correct
16 Correct 36 ms 27792 KB Output is correct
17 Correct 28 ms 27712 KB Output is correct
18 Correct 81 ms 39616 KB Output is correct
19 Correct 97 ms 43716 KB Output is correct
20 Correct 76 ms 37868 KB Output is correct
21 Correct 85 ms 40444 KB Output is correct
22 Correct 83 ms 37920 KB Output is correct
23 Correct 90 ms 40360 KB Output is correct
24 Correct 28 ms 27740 KB Output is correct
25 Correct 28 ms 27740 KB Output is correct
26 Correct 56 ms 37888 KB Output is correct
27 Correct 50 ms 35664 KB Output is correct
28 Correct 98 ms 51052 KB Output is correct
29 Correct 86 ms 51028 KB Output is correct
30 Correct 85 ms 51024 KB Output is correct
31 Correct 88 ms 51028 KB Output is correct
32 Correct 6 ms 14424 KB Output is correct
33 Correct 6 ms 14428 KB Output is correct
34 Correct 6 ms 14428 KB Output is correct
35 Correct 6 ms 14428 KB Output is correct
36 Correct 6 ms 14428 KB Output is correct
37 Correct 6 ms 14532 KB Output is correct
38 Correct 6 ms 14428 KB Output is correct
39 Correct 5 ms 14380 KB Output is correct
40 Correct 6 ms 14424 KB Output is correct
41 Correct 7 ms 14816 KB Output is correct
42 Correct 7 ms 14588 KB Output is correct
43 Correct 6 ms 14684 KB Output is correct
44 Correct 6 ms 14428 KB Output is correct
45 Correct 7 ms 14680 KB Output is correct
46 Correct 7 ms 14428 KB Output is correct
47 Correct 6 ms 14684 KB Output is correct
48 Correct 34 ms 22192 KB Output is correct
49 Correct 37 ms 22504 KB Output is correct
50 Correct 29 ms 22364 KB Output is correct
51 Correct 29 ms 22284 KB Output is correct
52 Correct 27 ms 22364 KB Output is correct
53 Correct 51 ms 30292 KB Output is correct
54 Correct 10 ms 16216 KB Output is correct
55 Correct 23 ms 20060 KB Output is correct
56 Correct 7 ms 14680 KB Output is correct
57 Correct 11 ms 15964 KB Output is correct
58 Correct 8 ms 15448 KB Output is correct
59 Correct 148 ms 51620 KB Output is correct
60 Correct 221 ms 65360 KB Output is correct
61 Incorrect 172 ms 69712 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102440153599307'
62 Halted 0 ms 0 KB -