oj.uz

Submission #925256

# Submission time Handle Problem Language Result Execution time Memory
925256 2024-02-11T08:25:44 Z IS_Rushdi Catfish Farm (IOI22_fish) C++17
9 / 100
 1000 ms 26256 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){
    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; i++){
        to[i].push_back(0);
        if(i > 1){
            to[i].push_back(n+2);
        }
        sort(to[i].begin(), to[i].end());
    }
    for(int i = 0; i < 4; i++){
        for(int j = 0; j < 4; j++){
            dp[0][i][j] = -1e18;
            dp[1][i][j] = -1e18;
        }
    }
    dp[0][0][0] = 0;
    dp[1][0][0] = 0;
    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:33:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int j = 0; j < to[i-2].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~~
fish.cpp:34:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |             for(int k = 0; k < to[i-1].size(); k++){
      |                            ~~^~~~~~~~~~~~~~~~
fish.cpp:35:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |                 for(int v = 0; v < to[i].size(); v++){
      |                                ~~^~~~~~~~~~~~~~
fish.cpp:32:13: warning: unused variable 'sz' [-Wunused-variable]
   32 |         int sz = 0;
      |             ^~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 21448 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20720 KB Output is correct
2 Correct 19 ms 20572 KB Output is correct
3 Correct 42 ms 21680 KB Output is correct
4 Correct 36 ms 22528 KB Output is correct
5 Correct 76 ms 26128 KB Output is correct
6 Correct 81 ms 26256 KB Output is correct
7 Correct 79 ms 26232 KB Output is correct
8 Correct 71 ms 26188 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20720 KB Output is correct
2 Correct 19 ms 20572 KB Output is correct
3 Correct 42 ms 21680 KB Output is correct
4 Correct 36 ms 22528 KB Output is correct
5 Correct 76 ms 26128 KB Output is correct
6 Correct 81 ms 26256 KB Output is correct
7 Correct 79 ms 26232 KB Output is correct
8 Correct 71 ms 26188 KB Output is correct
9 Incorrect 62 ms 26096 KB 1st lines differ - on the 1st token, expected: '99999', found: '99998'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 21448 KB Time limit exceeded
2 Halted 0 ms 0 KB -