oj.uz

답안 #661010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
661010 2022-11-23T20:43:30 Z mychecksedad 메기 농장 (IOI22_fish) C++17
32 / 100
 243 ms 192632 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][15], a[S][2], s[S], pref[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; ++i){
        for(int j = 0; j < 15; ++j) pref[i][j] = 0;
        for(int j = 0; j < 15; ++j) for(int k = 0; k < 15; ++k) dp[i][j][k] = 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){
            for(int k = 0; k < 10; ++k){
                if(i == 0){
                    dp[i][j][k] = pref[i + 1][j];
                    continue;
                }
                for(int l = 0; l < 10; ++l){
                    ll val;
                    if(k >= l){
                        val = max(0ll, pref[i - 1][j] - pref[i - 1][k]);
                    }else{
                        val = max(0ll, pref[i - 1][j] - pref[i - 1][l]);
                    }
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][k][l] + val - pref[i][min(k, j)] + pref[i + 1][j]);
                }
            }
        }
    }
    return *max_element(dp[n][0], dp[n][0] + 11);
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 26 ms 2656 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 82 ms 7300 KB Output is correct
6 Correct 81 ms 7276 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 46 ms 6188 KB Output is correct
3 Correct 56 ms 7264 KB Output is correct
4 Correct 22 ms 2132 KB Output is correct
5 Correct 26 ms 2644 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 4356 KB Output is correct
13 Correct 28 ms 4952 KB Output is correct
14 Correct 23 ms 4356 KB Output is correct
15 Correct 28 ms 4712 KB Output is correct
16 Correct 24 ms 4348 KB Output is correct
17 Correct 27 ms 4700 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 218 ms 188080 KB Output is correct
3 Correct 203 ms 170664 KB Output is correct
4 Correct 232 ms 189804 KB Output is correct
5 Correct 243 ms 192076 KB Output is correct
6 Correct 233 ms 191588 KB Output is correct
7 Correct 240 ms 192344 KB Output is correct
8 Correct 238 ms 192124 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 960 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 852 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 960 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 852 KB Output is correct
15 Incorrect 1 ms 828 KB 1st lines differ - on the 1st token, expected: '299', found: '171'
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 960 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 852 KB Output is correct
15 Incorrect 1 ms 828 KB 1st lines differ - on the 1st token, expected: '299', found: '171'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 218 ms 188080 KB Output is correct
3 Correct 203 ms 170664 KB Output is correct
4 Correct 232 ms 189804 KB Output is correct
5 Correct 243 ms 192076 KB Output is correct
6 Correct 233 ms 191588 KB Output is correct
7 Correct 240 ms 192344 KB Output is correct
8 Correct 238 ms 192124 KB Output is correct
9 Incorrect 240 ms 192632 KB 1st lines differ - on the 1st token, expected: '99999', found: '56251'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 26 ms 2656 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 82 ms 7300 KB Output is correct
6 Correct 81 ms 7276 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 46 ms 6188 KB Output is correct
9 Correct 56 ms 7264 KB Output is correct
10 Correct 22 ms 2132 KB Output is correct
11 Correct 26 ms 2644 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 4356 KB Output is correct
19 Correct 28 ms 4952 KB Output is correct
20 Correct 23 ms 4356 KB Output is correct
21 Correct 28 ms 4712 KB Output is correct
22 Correct 24 ms 4348 KB Output is correct
23 Correct 27 ms 4700 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 218 ms 188080 KB Output is correct
26 Correct 203 ms 170664 KB Output is correct
27 Correct 232 ms 189804 KB Output is correct
28 Correct 243 ms 192076 KB Output is correct
29 Correct 233 ms 191588 KB Output is correct
30 Correct 240 ms 192344 KB Output is correct
31 Correct 238 ms 192124 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 960 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 852 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 2 ms 852 KB Output is correct
46 Incorrect 1 ms 828 KB 1st lines differ - on the 1st token, expected: '299', found: '171'
47 Halted 0 ms 0 KB -