oj.uz

답안 #661021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
661021 2022-11-23T21:48:01 Z mychecksedad 메기 농장 (IOI22_fish) C++17
9 / 100
 82 ms 58920 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

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 26 ms 2648 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 7272 KB Output is correct
6 Correct 81 ms 7292 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 45 ms 6168 KB Output is correct
3 Correct 58 ms 7264 KB Output is correct
4 Correct 20 ms 2168 KB Output is correct
5 Correct 26 ms 2640 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 22 ms 4348 KB Output is correct
13 Correct 26 ms 4956 KB Output is correct
14 Correct 23 ms 4344 KB Output is correct
15 Correct 28 ms 4700 KB Output is correct
16 Correct 24 ms 4340 KB Output is correct
17 Correct 26 ms 4696 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 58920 KB Output is correct
3 Incorrect 42 ms 54392 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 308 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 308 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 308 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 58920 KB Output is correct
3 Incorrect 42 ms 54392 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
4 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 2648 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 7272 KB Output is correct
6 Correct 81 ms 7292 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 45 ms 6168 KB Output is correct
9 Correct 58 ms 7264 KB Output is correct
10 Correct 20 ms 2168 KB Output is correct
11 Correct 26 ms 2640 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 22 ms 4348 KB Output is correct
19 Correct 26 ms 4956 KB Output is correct
20 Correct 23 ms 4344 KB Output is correct
21 Correct 28 ms 4700 KB Output is correct
22 Correct 24 ms 4340 KB Output is correct
23 Correct 26 ms 4696 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 31 ms 58920 KB Output is correct
26 Incorrect 42 ms 54392 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '1999989354'
27 Halted 0 ms 0 KB -