oj.uz

Submission #661019

# Submission time Handle Problem Language Result Execution time Memory
661019 2022-11-23T21:27:14 Z mychecksedad Catfish Farm (IOI22_fish) C++17
9 / 100
 89 ms 58988 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
const int S = 1e5 + 100;


ll dp[S][15][2], a[S][2], s[S], pref[S][15], dppref[S][15], dpsuf[S][15];
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w){  
    bool case1 = 1, case2 = 1;
    for(int i = 0; i < m; ++i){
        if(x[i] % 2) case1 = 0;
        if(x[i] > 1) case2 = 0;
    }
    if(case1){
        ll ans = 0;
        for(int i = 0; i < m; ++i) ans += w[i];
        return ans;
    }
    if(case2){
        ll ans1 = 0, ans2 = 0;

        for(int i = 0; i < m; ++i){
            if(x[i] == 0) ans1 += w[i];
            else ans2 += w[i];
        }
        if(n == 2)
            return max(ans1, ans2);
        else{
            ll best = 0, sum = 0;
            int p = 0;
            for(int i = 0; i <= n + 1; ++i) a[i][0] = a[i][1] = s[i] = 0;
            for(int i = 0; i < m; i++) if(x[i] == 0) a[y[i]][0] = w[i]; else a[y[i]][1] = w[i];

            for(int i = n; i >= 0; --i) s[i] = s[i + 1] + a[i][1];

            for(int i = 0; i <= n + 1; ++i){
                best = max(best, s[i] + sum);
                sum += a[i][0];
            }

            return best;
        }
    }
    for(int i = 0; i <= n + 5; ++i){
        for(int j = 0; j < 15; ++j) pref[i][j] = dp[i][j][0] = dp[i][j][1] = dppref[i][j] = dpsuf[i][j] = 0;
    }
    for(int i = 0; i < m; ++i) pref[x[i]][y[i] + 1] = w[i];

    for(int i = 0; i <= n; ++i){
        for(int j = 1; j < 15; ++j) pref[i][j] += pref[i][j - 1];
    }
    for(int i = 0; i <= n; ++i){
        for(int j = 0; j < 10; ++j){    
            if(i == 0){
                dp[i][j][0] = dp[i][j][1] = pref[i + 1][j];
                continue;
            }

            dp[i][j][0] = pref[i + 1][j] + pref[i - 1][j] + dppref[i - 1][j];

            dp[i][j][1] = pref[i + 1][j] - pref[i][j] + dpsuf[i - 1][j];
        }

        for(int j = 0; j < 10; ++j){
            if(j == 0) dppref[i][j] = dp[i][j][0] - pref[i + 1][j] - pref[i][j];
            else dppref[i][j] = max(dppref[i][j - 1], dp[i][j][0] - pref[i + 1][j] - pref[i][j]);
        }

        for(int j = 9; j >= 0; --j){
            if(j == 9) dpsuf[i][j] = max(dp[i][j][0], dp[i][j][1]);
            else dpsuf[i][j] = max({dpsuf[i][j + 1], dp[i][j][0], dp[i][j][1]});
        }
    }
    return max(dp[n][0][0], dp[n][0][1]);
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:31:17: warning: unused variable 'p' [-Wunused-variable]
   31 |             int p = 0;
      |                 ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2260 KB Output is correct
2 Correct 27 ms 2640 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 88 ms 7288 KB Output is correct
6 Correct 89 ms 7244 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 46 ms 6188 KB Output is correct
3 Correct 60 ms 7276 KB Output is correct
4 Correct 22 ms 2168 KB Output is correct
5 Correct 33 ms 2632 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 22 ms 4308 KB Output is correct
13 Correct 27 ms 4956 KB Output is correct
14 Correct 23 ms 4336 KB Output is correct
15 Correct 27 ms 4692 KB Output is correct
16 Correct 24 ms 4352 KB Output is correct
17 Correct 27 ms 4708 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 58988 KB Output is correct
3 Incorrect 41 ms 55416 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '7818664569'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 58988 KB Output is correct
3 Incorrect 41 ms 55416 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2260 KB Output is correct
2 Correct 27 ms 2640 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 88 ms 7288 KB Output is correct
6 Correct 89 ms 7244 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 46 ms 6188 KB Output is correct
9 Correct 60 ms 7276 KB Output is correct
10 Correct 22 ms 2168 KB Output is correct
11 Correct 33 ms 2632 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 22 ms 4308 KB Output is correct
19 Correct 27 ms 4956 KB Output is correct
20 Correct 23 ms 4336 KB Output is correct
21 Correct 27 ms 4692 KB Output is correct
22 Correct 24 ms 4352 KB Output is correct
23 Correct 27 ms 4708 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 31 ms 58988 KB Output is correct
26 Incorrect 41 ms 55416 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
27 Halted 0 ms 0 KB -