oj.uz

Submission #749112

# Submission time Handle Problem Language Result Execution time Memory
749112 2023-05-27T10:53:17 Z vjudge1 Catfish Farm (IOI22_fish) C++17
50 / 100
 1000 ms 154680 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
 
ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){
    vector<vector<pair<int, ll>>> v(n);
    map<pair<int, int>, ll> mp;
    for(int i = 0; i < n; i++) mp[{i, 0}] = 0;
    for(int i = 0; i < n; i++) mp[{i, n+1}] = 0;
    for(int i = 0; i < m; i++){
        mp[{X[i], Y[i]+1}]+=W[i];
        if(X[i]) mp[{X[i]-1, Y[i]+1}]+=0;
        if(X[i]+1 < n) mp[{X[i]+1, Y[i]+1}]+=0;
    }
 
    for(auto [p, w]: mp) v[p.f].pb({p.sc, w});
 
    vector<vector<ll>> dp_up(n), dp_down, dtu2, pref;
    vector<ll> dtu(n, 0);
 
    for(int i = 0; i < n; i++) dp_up[i].resize(v[i].size(), 0);
    dp_down = dp_up;
    dtu2 = dp_up;
    pref = dp_up;
 
    for(int i = 0; i < n; i++) for(int j = 0; j < pref[i].size(); j++){
        if(j) pref[i][j] = pref[i][j-1];
        pref[i][j]+=v[i][j].sc;
    }
 
    for(int i = n-1; i >= 0; i--){
        for(int j = 0; j < v[i].size(); j++){
            if(i == n-1){
                dp_down[i][j] = 0;
                dp_up[i][j] = 0;
                continue;
            }
 
            int in1 = lower_bound(v[i+1].begin(), v[i+1].end(), make_pair(v[i][j].f, -1LL))-v[i+1].begin();
            if(in1 == v[i+1].size()) in1--;
 
            dp_up[i][j]-=pref[i][j];
            dp_down[i][j]-=pref[i+1].back()-pref[i+1][in1];
            dp_up[i][j] = max(dp_up[i][j], pref[i].back()-pref[i][j]+dp_down[i+1].back());
 
            if(i+2 < n){
                int in2 = lower_bound(v[i+2].begin(), v[i+2].end(), make_pair(v[i][j].f, -1LL))-v[i+2].begin();
                if(in2 == v[i+2].size()) in2--;
                dp_down[i][j] = max(dp_down[i][j], dtu2[i+2][in2]+pref[i+1][in1]);
                dp_down[i][j] = max(dp_down[i][j], dtu[i+2]-pref[i+1][in1]);
                dp_down[i][j] = max(dp_down[i][j], pref[i+1].back()+dp_down[i+2].back());
            }
        }
 
        if(i){
            ll mx = 0, s = 0;
            auto it = v[i-1].begin();
            for(int j = 0; j < v[i].size(); j++){
                while(it != v[i-1].end() && it->f <= v[i][j].f) s+=it->sc, it++;
                mx = max(mx, s+dp_up[i][j]);
            }
            fill(dp_up[i-1].begin(), dp_up[i-1].end(), mx);
            dtu[i] = mx;
 
            mx = 0;
            for(int j = 0; j < v[i].size(); j++) mx = max(mx, pref[i].back()-pref[i][j]+dp_down[i][j]);
            fill(dp_down[i-1].begin(), dp_down[i-1].end(), mx);
 
            for(int j = 0; j < v[i].size(); j++){
                if(j) dtu2[i][j] = dtu2[i][j-1];
                dtu2[i][j] = max(dtu2[i][j], dp_up[i][j]);
            }
        }
    }
 
    return max(*max_element(dp_up[0].begin(), dp_up[0].end()), *max_element(dp_down[0].begin(), dp_down[0].end()));
}

Compilation message

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:30:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0; i < n; i++) for(int j = 0; j < pref[i].size(); j++){
      |                                               ~~^~~~~~~~~~~~~~~~
fish.cpp:36:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int j = 0; j < v[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~
fish.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             if(in1 == v[i+1].size()) in1--;
      |                ~~~~^~~~~~~~~~~~~~~~
fish.cpp:52:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |                 if(in2 == v[i+2].size()) in2--;
      |                    ~~~~^~~~~~~~~~~~~~~~
fish.cpp:62:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for(int j = 0; j < v[i].size(); j++){
      |                            ~~^~~~~~~~~~~~~
fish.cpp:70:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for(int j = 0; j < v[i].size(); j++) mx = max(mx, pref[i].back()-pref[i][j]+dp_down[i][j]);
      |                            ~~^~~~~~~~~~~~~
fish.cpp:73:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             for(int j = 0; j < v[i].size(); j++){
      |                            ~~^~~~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 59320 KB Output is correct
2 Correct 277 ms 68464 KB Output is correct
3 Correct 104 ms 42508 KB Output is correct
4 Correct 102 ms 42456 KB Output is correct
5 Execution timed out 1050 ms 154680 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 445 ms 73368 KB Output is correct
3 Correct 520 ms 83556 KB Output is correct
4 Correct 210 ms 59336 KB Output is correct
5 Correct 291 ms 68484 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 105 ms 42536 KB Output is correct
11 Correct 96 ms 42488 KB Output is correct
12 Correct 300 ms 68384 KB Output is correct
13 Correct 358 ms 79676 KB Output is correct
14 Correct 276 ms 63764 KB Output is correct
15 Correct 240 ms 62028 KB Output is correct
16 Correct 254 ms 63788 KB Output is correct
17 Correct 286 ms 70896 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 42444 KB Output is correct
2 Correct 96 ms 42444 KB Output is correct
3 Correct 158 ms 46028 KB Output is correct
4 Correct 144 ms 48204 KB Output is correct
5 Correct 254 ms 55936 KB Output is correct
6 Correct 262 ms 55368 KB Output is correct
7 Correct 262 ms 55736 KB Output is correct
8 Correct 244 ms 55892 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 596 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 55 ms 9548 KB Output is correct
18 Correct 51 ms 8324 KB Output is correct
19 Correct 49 ms 8628 KB Output is correct
20 Correct 49 ms 7644 KB Output is correct
21 Correct 48 ms 7632 KB Output is correct
22 Correct 109 ms 14784 KB Output is correct
23 Correct 13 ms 3540 KB Output is correct
24 Correct 47 ms 8652 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 12 ms 3156 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 55 ms 9548 KB Output is correct
18 Correct 51 ms 8324 KB Output is correct
19 Correct 49 ms 8628 KB Output is correct
20 Correct 49 ms 7644 KB Output is correct
21 Correct 48 ms 7632 KB Output is correct
22 Correct 109 ms 14784 KB Output is correct
23 Correct 13 ms 3540 KB Output is correct
24 Correct 47 ms 8652 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 12 ms 3156 KB Output is correct
27 Correct 6 ms 2644 KB Output is correct
28 Correct 462 ms 40572 KB Output is correct
29 Correct 771 ms 68324 KB Output is correct
30 Incorrect 988 ms 117816 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102440153599307'
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 42444 KB Output is correct
2 Correct 96 ms 42444 KB Output is correct
3 Correct 158 ms 46028 KB Output is correct
4 Correct 144 ms 48204 KB Output is correct
5 Correct 254 ms 55936 KB Output is correct
6 Correct 262 ms 55368 KB Output is correct
7 Correct 262 ms 55736 KB Output is correct
8 Correct 244 ms 55892 KB Output is correct
9 Correct 329 ms 80608 KB Output is correct
10 Correct 202 ms 36408 KB Output is correct
11 Correct 454 ms 72776 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 98 ms 42508 KB Output is correct
19 Correct 96 ms 42584 KB Output is correct
20 Correct 104 ms 42564 KB Output is correct
21 Correct 96 ms 42568 KB Output is correct
22 Correct 359 ms 80460 KB Output is correct
23 Incorrect 541 ms 94284 KB 1st lines differ - on the 1st token, expected: '77772396150817', found: '77782926777237'
24 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 59320 KB Output is correct
2 Correct 277 ms 68464 KB Output is correct
3 Correct 104 ms 42508 KB Output is correct
4 Correct 102 ms 42456 KB Output is correct
5 Execution timed out 1050 ms 154680 KB Time limit exceeded
6 Halted 0 ms 0 KB -