oj.uz

Submission #629655

# Submission time Handle Problem Language Result Execution time Memory
629655 2022-08-14T20:49:23 Z Ronin13 Catfish Farm (IOI22_fish) C++17
12 / 100
 942 ms 108304 KB 
#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb push_back
#define epb emplace_back
#define f first
#define s second
#include <vector>

using namespace std;

map<pii, ll> val;
map <pii, ll> dp;
map <pii, ll> DP;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    int n = N;
    int m = M;
    vector <vector <int> > vec(n + 2);
    for(int i = 0; i < m; i++){
        vec[X[i] + 1].pb(Y[i] + 1);
        val[{X[i] + 1, Y[i] + 1}] = W[i];
    }
    for(int i = 0; i <= n + 1; i++){
        vec[i].pb(0);
        vec[i].pb(n + 1);
        sort(vec[i].begin(), vec[i].end());
    }
    for(int i = 1; i <= n + 1; i++){
        if(i > 1){

            int ind = 0;
            ll last = -1;
            int rit;
            for(rit = vec[i].size() - 1; rit >= 0; rit--){
                int j = vec[i][rit];
                int a = vec[i - 2].back();
                int b = vec[i - 2][0];
                int v = val[{i, j}];
                if(last == -1){
                    dp[{i, j}] = max(DP[{i - 2, a}] + v, dp[{i - 2, b}] + v);
                }
                else{
                    int vv = upper_bound(vec[i - 1].begin(), vec[i - 1].end(), j) - vec[i - 1].begin();
                    vv = vec[i - 1][vv];
                    dp[{i, j}] = max(last + v, dp[{i - 1, vv}] + v);
                }
                last = dp[{i, j}];
            }
        }
        int it = 0;
        ll last = -1;
        for(it = 0; it < vec[i].size(); it++){
            int j = vec[i][it];
            ll v = val[{i, j}];
            if(last == -1){
                //int x = *vec[i - 1].begin();
                DP[{i, j}] = dp[{i - 1, 0}] + v;
            }
            else{
                int x = lower_bound(vec[i - 1].begin(), vec[i - 1].end(), j) - vec[i - 1].begin();
                x--;
                x = vec[i - 1][x];
                DP[{i, j}] = max(DP[{i - 1, x}], last) + v;
            }
            last = DP[{i, j}];
        }
    }
    ll ans = DP[{n + 1, 0}];
    for(int i = 1; i <= n; i++){
        ans = max(ans, DP[{i, 0}]);
    }
    return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:35:17: warning: unused variable 'ind' [-Wunused-variable]
   35 |             int ind = 0;
      |                 ^~~
fish.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(it = 0; it < vec[i].size(); it++){
      |                     ~~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 51240 KB Output is correct
2 Correct 412 ms 58528 KB Output is correct
3 Correct 270 ms 43212 KB Output is correct
4 Correct 274 ms 43260 KB Output is correct
5 Correct 942 ms 108056 KB Output is correct
6 Correct 837 ms 108304 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 43260 KB Output is correct
2 Correct 283 ms 43336 KB Output is correct
3 Correct 265 ms 50252 KB Output is correct
4 Correct 296 ms 50952 KB Output is correct
5 Correct 503 ms 64412 KB Output is correct
6 Correct 483 ms 64540 KB Output is correct
7 Correct 488 ms 64452 KB Output is correct
8 Correct 492 ms 64496 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 43260 KB Output is correct
2 Correct 283 ms 43336 KB Output is correct
3 Correct 265 ms 50252 KB Output is correct
4 Correct 296 ms 50952 KB Output is correct
5 Correct 503 ms 64412 KB Output is correct
6 Correct 483 ms 64540 KB Output is correct
7 Correct 488 ms 64452 KB Output is correct
8 Correct 492 ms 64496 KB Output is correct
9 Incorrect 511 ms 64488 KB 1st lines differ - on the 1st token, expected: '99999', found: '99998'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 51240 KB Output is correct
2 Correct 412 ms 58528 KB Output is correct
3 Correct 270 ms 43212 KB Output is correct
4 Correct 274 ms 43260 KB Output is correct
5 Correct 942 ms 108056 KB Output is correct
6 Correct 837 ms 108304 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -