oj.uz

답안 #660742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660742 2022-11-23T06:25:51 Z mychecksedad 메기 농장 (IOI22_fish) C++17
9 / 100
 77 ms 10832 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<int> v(n+5); 
        for(int i = 0; i < n; ++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]);
            dp[i][1] = v[i + 1];
            if(i>2){
                dp[i][1] += max({dp[i - 2][0] + v[i - 1], dp[i - 2][1], dp[i - 1][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

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2164 KB Output is correct
2 Correct 26 ms 2640 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 76 ms 7276 KB Output is correct
6 Correct 77 ms 7288 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 48 ms 8980 KB Output is correct
3 Correct 62 ms 10832 KB Output is correct
4 Correct 24 ms 3540 KB Output is correct
5 Correct 29 ms 4292 KB Output is correct
6 Correct 1 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 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 26 ms 5724 KB Output is correct
13 Correct 28 ms 6712 KB Output is correct
14 Correct 27 ms 5692 KB Output is correct
15 Correct 28 ms 6356 KB Output is correct
16 Correct 27 ms 5744 KB Output is correct
17 Correct 30 ms 6220 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 3 ms 4308 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 3 ms 4308 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2164 KB Output is correct
2 Correct 26 ms 2640 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 76 ms 7276 KB Output is correct
6 Correct 77 ms 7288 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 48 ms 8980 KB Output is correct
9 Correct 62 ms 10832 KB Output is correct
10 Correct 24 ms 3540 KB Output is correct
11 Correct 29 ms 4292 KB Output is correct
12 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 26 ms 5724 KB Output is correct
19 Correct 28 ms 6712 KB Output is correct
20 Correct 27 ms 5692 KB Output is correct
21 Correct 28 ms 6356 KB Output is correct
22 Correct 27 ms 5744 KB Output is correct
23 Correct 30 ms 6220 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Runtime error 3 ms 4308 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -