oj.uz

Submission #652686

# Submission time Handle Problem Language Result Execution time Memory
652686 2022-10-23T20:43:54 Z Lobo Catfish Farm (IOI22_fish) C++17
14 / 100
 69 ms 18960 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()

const int maxn = 330;
const int maxh = 12;
const int maxqh = 12;
const int inf = 1e18+10;

int n, m, dp[maxn][maxqh][maxqh];
vector<pair<int,int>> fish[maxn]; // fishs from column i
vector<int> hr[maxn]; // important heights from column i, the ones that can be chosen

long long max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    n = N;
    m = M;

    for(int i = 0; i < m; i++) {
        fish[X[i]+1].pb(mp(Y[i]+1,W[i]));
        hr[X[i]+1].pb(Y[i]);
    }

    for(int i = 0; i <= n; i++) {
        hr[i].pb(0);
        hr[i].pb(maxh-1);
        sort(all(hr[i]));
        hr[i].erase(unique(all(hr[i])),hr[i].end());
    }

    // dp[i][h1][h] = until i and with h[i-1] = h1 and h[i] = h

    // dp[1][0][h] = 0;
    for(int i = 0; i <= maxh-1; i++) dp[1][0][i] = 0;
    for(int i = 2; i <= n; i++) {
        for(int h1 = 0; h1 <= maxh-1; h1++) {
            for(int h = 0; h <= maxh-1; h++) {
                dp[i][h1][h] = 0;

                int plus10 = 0; // fishs that 1 catchs in 0
                for(auto aux : fish[i]) {
                    int y = aux.fr;
                    int w = aux.sc;
                    if(y > h && y <= h1) plus10+= w;
                }

                for(int h2 = 0; h2 <= maxh-1; h2++) {
                    int plus01 = 0; // fishs that 0 catchs in 1 and had not been caught by 2

                    for(auto aux : fish[i-1]) {
                        int y = aux.fr;
                        int w = aux.sc;
                        if(y > h1 && y <= h && y > h2) plus01+= w;
                    }
                    dp[i][h1][h] = max(dp[i][h1][h],dp[i-1][h2][h1]+plus01 + plus10);
                }
            }
        }
    }

    int ans = 0;
    for(int h = 0; h <= maxh-1; h++) {
        for(int h1 = 0; h1 <= maxh-1; h1++) {
            ans = max(ans,dp[n][h1][h]);
        }
    }
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 32 ms 10224 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 69 ms 18960 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 10 ms 728 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 10 ms 728 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Incorrect 2 ms 596 KB 1st lines differ - on the 1st token, expected: '299', found: '11'
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 10 ms 728 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Incorrect 2 ms 596 KB 1st lines differ - on the 1st token, expected: '299', found: '11'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 32 ms 10224 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -