oj.uz

Submission #660842

# Submission time Handle Problem Language Result Execution time Memory
660842 2022-11-23T10:15:53 Z mychecksedad Catfish Farm (IOI22_fish) C++17
9 / 100
 83 ms 7288 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][2], a[S][2], suf[S];
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, case3 = 1;
    for(int i = 0; i < m; ++i){
        if(x[i] % 2) case1 = 0;
        if(x[i] > 1) case2 = 0;
        if(y[i] != 0) case3 = 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] = suf[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) suf[i] = suf[i + 1] + a[i][1];

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

            return best;
        }
    }
    if(case3){
        for(int i = 0; i <= n; ++i){
            dp[i][0] = dp[i][1] = 0;
        }
        vector<ll> v(S); 
        for(int i = 0; i < m; ++i) v[x[i]] = w[i];
        for(int i = 1; i <= n; ++i){
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + v[i]);
            if(i>=3)
                dp[i][1] = max({dp[i - 1][1], dp[i - 2][1] + v[i - 1], dp[i - 3][1] + v[i - 2] + v[i - 1]});
            else if(i==2)
                dp[i][1] = max({dp[i - 1][1], dp[i - 2][1] + v[i - 1], dp[i - 2][0] + v[i - 1]});
            else
                dp[i][1] = max({dp[i - 1][1], dp[i - 1][0] + v[i - 1]});
        }
        return max(dp[n][0], dp[n][1]);
    }
    return -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:32:17: warning: unused variable 'p' [-Wunused-variable]
   32 |             int p = 0;
      |                 ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2168 KB Output is correct
2 Correct 26 ms 2652 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 83 ms 7288 KB Output is correct
6 Correct 81 ms 7280 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 55 ms 7272 KB Output is correct
4 Correct 20 ms 2132 KB Output is correct
5 Correct 27 ms 2656 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 0 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 23 ms 4352 KB Output is correct
13 Correct 27 ms 4944 KB Output is correct
14 Correct 24 ms 4216 KB Output is correct
15 Correct 27 ms 4720 KB Output is correct
16 Correct 23 ms 4340 KB Output is correct
17 Correct 26 ms 4692 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 2 ms 2644 KB Output is correct
3 Correct 15 ms 3668 KB Output is correct
4 Correct 12 ms 4064 KB Output is correct
5 Incorrect 28 ms 5556 KB 1st lines differ - on the 1st token, expected: '1673106170551', found: '1673122841934'
6 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '-1'
2 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 2 ms 2644 KB Output is correct
3 Correct 15 ms 3668 KB Output is correct
4 Correct 12 ms 4064 KB Output is correct
5 Incorrect 28 ms 5556 KB 1st lines differ - on the 1st token, expected: '1673106170551', found: '1673122841934'
6 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2168 KB Output is correct
2 Correct 26 ms 2652 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 83 ms 7288 KB Output is correct
6 Correct 81 ms 7280 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 46 ms 6188 KB Output is correct
9 Correct 55 ms 7272 KB Output is correct
10 Correct 20 ms 2132 KB Output is correct
11 Correct 27 ms 2656 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 0 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 23 ms 4352 KB Output is correct
19 Correct 27 ms 4944 KB Output is correct
20 Correct 24 ms 4216 KB Output is correct
21 Correct 27 ms 4720 KB Output is correct
22 Correct 23 ms 4340 KB Output is correct
23 Correct 26 ms 4692 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 15 ms 3668 KB Output is correct
27 Correct 12 ms 4064 KB Output is correct
28 Incorrect 28 ms 5556 KB 1st lines differ - on the 1st token, expected: '1673106170551', found: '1673122841934'
29 Halted 0 ms 0 KB -