oj.uz

답안 #925250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925250 2024-02-11T08:12:34 Z IS_Rushdi 메기 농장 (IOI22_fish) C++17
32 / 100
 846 ms 23124 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+1][4][4]{};
            vector<pair<int,int>>to[n+1];
            for(int i = 0; i < m; i++){to[x[i]+1].push_back({y[i]+1,w[i]});}
            for(int i = 0; i <= n; i++){
                to[i].push_back({0,0});
                to[i].push_back({n,0});

                sort(to[i].begin(), to[i].end());
            }
            for(int i = 0; i < to[0].size(); i++){
                for(int j = 0; j < to[0].size(); j++){
                    dp[0][i][j] = -1e18;
                }
            }
            dp[0][0][0] = 0;
            long long ans = 0;
            for(int i = 1; i <= n; i++){
                for(int j = 0; j < to[max(i-2,0)].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];
                            int cur = to[i][v].first;
                            for(auto nodes : to[i-1]){
                                if(cur > max(to[i-2][j].first,to[i-1][k].first)){
                                    if(nodes.first > max(to[i-2][j].first,to[i-1][k].first)){
                                        now += nodes.second;
                                    }
                                }
                            }
                            cur = to[i-1][k].first;
                            for(auto nodes : to[i]){
                                if(cur > to[i][v].first){
                                    if(nodes.first > to[i][v].first){
                                        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:82:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             for(int i = 0; i < to[0].size(); i++){
      |                            ~~^~~~~~~~~~~~~~
fish.cpp:83:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |                 for(int j = 0; j < to[0].size(); j++){
      |                                ~~^~~~~~~~~~~~~~
fish.cpp:90:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |                 for(int j = 0; j < to[max(i-2,0)].size(); j++){
      |                                ~~^~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:91:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                     for(int k = 0; k < to[i-1].size(); k++){
      |                                    ~~^~~~~~~~~~~~~~~~
fish.cpp:92:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |                         for(int v = 0; v < to[i].size(); v++){
      |                                        ~~^~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2896 KB Output is correct
2 Correct 22 ms 3420 KB Output is correct
3 Correct 5 ms 4344 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 68 ms 7288 KB Output is correct
6 Correct 70 ms 7248 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 37 ms 4916 KB Output is correct
3 Correct 46 ms 5844 KB Output is correct
4 Correct 18 ms 2928 KB Output is correct
5 Correct 22 ms 3412 KB Output is correct
6 Correct 0 ms 344 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 344 KB Output is correct
10 Correct 6 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 22 ms 3420 KB Output is correct
14 Correct 19 ms 2904 KB Output is correct
15 Correct 21 ms 3164 KB Output is correct
16 Correct 19 ms 2908 KB Output is correct
17 Correct 21 ms 3292 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4440 KB Output is correct
2 Correct 5 ms 4340 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 13 ms 5212 KB Output is correct
5 Correct 27 ms 6712 KB Output is correct
6 Correct 24 ms 6492 KB Output is correct
7 Correct 27 ms 6480 KB Output is correct
8 Correct 31 ms 6484 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 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 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 448 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 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 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 448 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 Runtime error 846 ms 524 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 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 2 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 448 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 Runtime error 846 ms 524 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4440 KB Output is correct
2 Correct 5 ms 4340 KB Output is correct
3 Correct 17 ms 5212 KB Output is correct
4 Correct 13 ms 5212 KB Output is correct
5 Correct 27 ms 6712 KB Output is correct
6 Correct 24 ms 6492 KB Output is correct
7 Correct 27 ms 6480 KB Output is correct
8 Correct 31 ms 6484 KB Output is correct
9 Correct 67 ms 23124 KB Output is correct
10 Correct 35 ms 6808 KB Output is correct
11 Correct 72 ms 13148 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 6 ms 4188 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 6 ms 4188 KB Output is correct
21 Correct 23 ms 18432 KB Output is correct
22 Incorrect 87 ms 22096 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '51217430438990'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2896 KB Output is correct
2 Correct 22 ms 3420 KB Output is correct
3 Correct 5 ms 4344 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 68 ms 7288 KB Output is correct
6 Correct 70 ms 7248 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 37 ms 4916 KB Output is correct
9 Correct 46 ms 5844 KB Output is correct
10 Correct 18 ms 2928 KB Output is correct
11 Correct 22 ms 3412 KB Output is correct
12 Correct 0 ms 344 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 344 KB Output is correct
16 Correct 6 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 22 ms 3420 KB Output is correct
20 Correct 19 ms 2904 KB Output is correct
21 Correct 21 ms 3164 KB Output is correct
22 Correct 19 ms 2908 KB Output is correct
23 Correct 21 ms 3292 KB Output is correct
24 Correct 7 ms 4440 KB Output is correct
25 Correct 5 ms 4340 KB Output is correct
26 Correct 17 ms 5212 KB Output is correct
27 Correct 13 ms 5212 KB Output is correct
28 Correct 27 ms 6712 KB Output is correct
29 Correct 24 ms 6492 KB Output is correct
30 Correct 27 ms 6480 KB Output is correct
31 Correct 31 ms 6484 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 600 KB Output is correct
37 Correct 1 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 0 ms 348 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 2 ms 448 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 Runtime error 846 ms 524 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -