oj.uz

Submission #925264

# Submission time Handle Problem Language Result Execution time Memory
925264 2024-02-11T08:36:02 Z IS_Rushdi Catfish Farm (IOI22_fish) C++17
46 / 100
 1000 ms 58192 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
 
 
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    int mx = *max_element(y.begin(),y.end());
    if(mx <= 8){
        long long dp[n+1][mx+2][mx+2]{};
        int sum[n+1][mx+2]{};
        for(int i = 0; i < m; i++) x[i] += 1;
        for(int i = 0; i < m; i++) y[i] += 1;
        for(int i = 0; i < m; i++) sum[x[i]][y[i]] += w[i];
        long long ans = 0;
        
        for(int i = 0; i < 1; i++){
            for(int j = 0; j < mx+2; j++){
                for(int k = 0; k < mx+2; k++){
                    dp[i][j][k] = -1e18;
                }
            }
        }
        dp[0][0][0] = 0;
        for(int i = 1; i <= n; i++){
            for(int j = 0; j < mx+2; j++){
                for(int k = 0; k < mx+2; k++){
                    for(int v = 0; v < mx+2; v++){
                        long long now = dp[i-1][k][j];
                        int cur = v;
                        while(cur > max(j,k)) now += sum[i-1][cur--];
                        cur = k;
                        while(cur > v) now += sum[i][cur--];
                        
                        dp[i][v][k] = max(dp[i][v][k],now);
                        ans = max(ans,now);
                    }
                }
            }
        }
        return ans;
    }
    
    mx = *max_element(x.begin(),x.end());
    if(mx <= 1){
        long long ans = 0;
        long long ans2 = 0;
        int cost[n][2]{};
        for(int i = 0; i < m; i++){
            if(x[i] == 1){cost[y[i]][1] = w[i]; ans += w[i];}
            if(x[i] == 0){ans2 += w[i];cost[y[i]][0]=w[i];}
        }
        if(n == 2 || n == 1) return max(ans,ans2);
        ans2 = max(ans,ans2);
        
        for(int i = 1; i < n; i++){
            ans -= cost[i-1][1];
            ans += cost[i-1][0];
    
            ans2 = max(ans2,ans);
        }
        return ans2;
    }else{
        bool z = 1;
        for(int i = 0; i < n; i++){
            z = (z && (x[i] % 2 == 0));
        }
        if(z){
            long long sum = 0;
            for(int i = 0; i < m; i++) sum += w[i];
            return sum;
        }
        else{
            long long dp[n+2][4][4]{};
    
    vector<pair<int,int>>hv[n+2];
    vector<int>to[n+2];
    for(int i = 0; i < m; i++){
        hv[x[i]+2].push_back({y[i]+1,w[i]});
        to[x[i]+2].push_back(y[i]);    
    }

    for(int i = 0; i <= n+1; i++){
        to[i].push_back(0);
        if(i > 1){
            to[i].push_back(n+3);
        }
    }
    long long ans = 0;
    for(int i = 2; i <= n+1; i++){
        int sz = 0;
        for(int j = 0; j < to[i-2].size(); j++){
            for(int k = 0; k < to[i-1].size(); k++){
                for(int v = 0; v < to[i].size(); v++){
                    long long now = dp[i-1][k][j];
                    for(auto nodes : hv[i-1]){
                        if(nodes.first > max(to[i-2][j],to[i-1][k])){
                            if(nodes.first <= to[i][v]){
                                now += nodes.second;
                            }
                        }
                    }
                    for(auto nodes : hv[i]){
                        if(nodes.first > to[i][v]){
                            if(nodes.first <= to[i-1][k]){
                                now += nodes.second;
                            }
                        }
                    }
                    
                    dp[i][v][k] = max(dp[i][v][k],now);
                    ans = max(ans,now);
                    }
                }
            }
        }
        return ans;
        }
    }
}
 
// int main(){
//     cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
// }

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:91:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int j = 0; j < to[i-2].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~~
fish.cpp:92:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             for(int k = 0; k < to[i-1].size(); k++){
      |                            ~~^~~~~~~~~~~~~~~~
fish.cpp:93:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                 for(int v = 0; v < to[i].size(); v++){
      |                                ~~^~~~~~~~~~~~~~
fish.cpp:90:13: warning: unused variable 'sz' [-Wunused-variable]
   90 |         int sz = 0;
      |             ^~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2908 KB Output is correct
2 Correct 24 ms 3416 KB Output is correct
3 Correct 5 ms 4440 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 85 ms 7268 KB Output is correct
6 Correct 75 ms 7248 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 39 ms 4764 KB Output is correct
3 Correct 49 ms 5716 KB Output is correct
4 Correct 19 ms 2900 KB Output is correct
5 Correct 23 ms 3420 KB Output is correct
6 Correct 1 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 5 ms 4188 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 18 ms 2908 KB Output is correct
13 Correct 26 ms 3416 KB Output is correct
14 Correct 22 ms 2936 KB Output is correct
15 Correct 25 ms 3152 KB Output is correct
16 Correct 20 ms 2936 KB Output is correct
17 Correct 21 ms 3160 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4388 KB Output is correct
2 Correct 5 ms 4184 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 13 ms 5160 KB Output is correct
5 Correct 28 ms 6504 KB Output is correct
6 Correct 27 ms 6492 KB Output is correct
7 Correct 26 ms 6736 KB Output is correct
8 Correct 27 ms 6476 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 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 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 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 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Execution timed out 1063 ms 348 KB Time limit exceeded
17 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 1 ms 348 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 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 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Execution timed out 1063 ms 348 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4388 KB Output is correct
2 Correct 5 ms 4184 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 13 ms 5160 KB Output is correct
5 Correct 28 ms 6504 KB Output is correct
6 Correct 27 ms 6492 KB Output is correct
7 Correct 26 ms 6736 KB Output is correct
8 Correct 27 ms 6476 KB Output is correct
9 Correct 83 ms 26196 KB Output is correct
10 Correct 29 ms 6904 KB Output is correct
11 Correct 74 ms 13288 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 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 Correct 0 ms 348 KB Output is correct
18 Correct 6 ms 4324 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 6 ms 4440 KB Output is correct
21 Correct 19 ms 20668 KB Output is correct
22 Correct 73 ms 25172 KB Output is correct
23 Correct 237 ms 58192 KB Output is correct
24 Correct 164 ms 28608 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2908 KB Output is correct
2 Correct 24 ms 3416 KB Output is correct
3 Correct 5 ms 4440 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 85 ms 7268 KB Output is correct
6 Correct 75 ms 7248 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 39 ms 4764 KB Output is correct
9 Correct 49 ms 5716 KB Output is correct
10 Correct 19 ms 2900 KB Output is correct
11 Correct 23 ms 3420 KB Output is correct
12 Correct 1 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 5 ms 4188 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 18 ms 2908 KB Output is correct
19 Correct 26 ms 3416 KB Output is correct
20 Correct 22 ms 2936 KB Output is correct
21 Correct 25 ms 3152 KB Output is correct
22 Correct 20 ms 2936 KB Output is correct
23 Correct 21 ms 3160 KB Output is correct
24 Correct 6 ms 4388 KB Output is correct
25 Correct 5 ms 4184 KB Output is correct
26 Correct 17 ms 5212 KB Output is correct
27 Correct 13 ms 5160 KB Output is correct
28 Correct 28 ms 6504 KB Output is correct
29 Correct 27 ms 6492 KB Output is correct
30 Correct 26 ms 6736 KB Output is correct
31 Correct 27 ms 6476 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 512 KB Output is correct
35 Correct 1 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 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 464 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Execution timed out 1063 ms 348 KB Time limit exceeded
48 Halted 0 ms 0 KB -