oj.uz

답안 #829376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829376 2023-08-18T09:58:15 Z tolbi 메기 농장 (IOI22_fish) C++17
61 / 100
 1000 ms 95232 KB 
#include <bits/stdc++.h>
using namespace std;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
typedef long long ll;
#include "fish.h"
vector<vector<ll>> dp;
vector<int> X,Y;
int N,M;
vector<vector<ll>> pref;
vector<vector<int>> ind;
vector<vector<int>> pos;
ll query(int x, int l, int r){
    if (pos[x].back()<l) return 0ll;
    if (pos[x][0]>r) return 0ll;
    if (l>r) return 0ll;
    auto itl = lower_bound(pos[x].begin(), pos[x].end(), l);
    auto itr = lower_bound(pos[x].begin(), pos[x].end(), r+1);
    itr--;
    ll hueh = 0;
    if (itl!=pos[x].begin()){
        itl--;
        hueh = pref[x][(itl-pos[x].begin())];
    }
    return pref[x][(itr-pos[x].begin())]-hueh;
}
int getup(int node){
    int xv = X[node];
    int yv = Y[node];
    return ind[xv][lower_bound(pos[xv].begin(), pos[xv].end(), yv+1)-pos[xv].begin()];
}
int getdown(int node){
    int xv = X[node];
    int yv = Y[node];
    return ind[xv][lower_bound(pos[xv].begin(), pos[xv].end(), yv)-pos[xv].begin()-1];
}
int getnextup(int node){
    int xv = X[node];
    int yv = Y[node];
    for (int i = 0; i < pos[xv+1].size(); i++){
        if (pos[xv+1][i]>=yv){
            return ind[xv+1][i];
        }
    }
    assert(false);
    return 23;
}
int getnextdown(int node){
    int xv = X[node];
    int yv = Y[node];
    for (int i = pos[xv+1].size()-1; i >= 0; i--){
        if (pos[xv+1][i]<=yv){
            return ind[xv+1][i];
        }
    }
    assert(false);
    return 23;
}
long long f(int node, int flag){
    int x = X[node];
    int y = Y[node];
    //cout<<x<<" "<<y<<" "<<flag<<endl;
    if (dp[node][flag]!=-1) return dp[node][flag];
    if (flag==1){
        dp[node][flag]=0;
        if (y<N){
            ll crr = 0;
            int next = getup(node);
            if (x>0) crr = query(x-1,y,Y[next]-1);
            dp[node][flag]=crr+f(getup(node),1);
        }
        if (x+1<N){
            int next = getnextup(node);
            ll crr = query(x,y,Y[next]-1);
            dp[node][flag]=max(dp[node][flag],crr+f(next,1));
            next=getnextdown(node);
            crr = query(x+1,Y[next],y-1);
            dp[node][flag]=max(dp[node][flag],crr+f(next,0));
        }
    }
    else if (flag==0){
        dp[node][flag]=0;
        if (y-1>=0){
            int next = getdown(node);
            dp[node][flag]=query(x,Y[next],y-1)+f(next,0);
        }
        if (x+1<N){
            dp[node][flag]=max(dp[node][flag],f(getnextup(node),0));
            if (y==0){
                dp[node][flag]=max(dp[node][flag],f(M+x+1,2));
            }
        }
    }
    else {
        dp[node][flag]=0;
        if (y<N){
            dp[node][flag]=f(getup(node),2);
        }
        if (x+1<N){
            int next = getnextup(node);
            ll crr = query(x,y,Y[next]-1);
            dp[node][flag]=max(dp[node][flag],crr+f(next,1));
            next=getnextdown(node);
            crr = query(x+1,Y[next],y-1);
            dp[node][flag]=max(dp[node][flag],crr+f(next,0));
        }
    }
    if (flag!=0 && x+2<N){
        dp[node][flag]=max(dp[node][flag],f(M+x+2,1));
    }
    //cout<<x<<" "<<y<<" "<<flag<<" "<<dp[node][flag]<<endl;
    return dp[node][flag];
};

long long max_weights(int _N, int _M, std::vector<int> _X, std::vector<int> _Y, std::vector<int> _W) {
    vector<vector<pair<int,pair<ll,int>>>> arr;
    N=_N;
    vector<int> W;
    arr.resize(N);
    vector<int> bb(N,0);
    for (int i = 0; i < _Y.size(); ++i)
    {
        if (_Y[i]==0) bb[_X[i]]=_W[i];
        else {
            X.push_back(_X[i]);
            Y.push_back(_Y[i]);
            W.push_back(_W[i]);
            M++;
        }
    }
    for (int i = 0; i < N; ++i)
    {
        X.push_back(i);
        Y.push_back(0);
        W.push_back(bb[i]);
    }
    for (int i = 0; i < N; i++){
        X.push_back(i);
        Y.push_back(N);
        W.push_back(0);
    }
    for (int i = 0; i < Y.size(); i++){
        arr[X[i]].push_back({Y[i],{W[i],i}});
    }
    pref.resize(arr.size());
    pos.resize(arr.size());
    ind.resize(arr.size());
    for (int i = 0; i < N; ++i)
    {
        sort(arr[i].begin(), arr[i].end());
        pref[i].resize(arr[i].size());
        pos[i].resize(arr[i].size());
        ind[i].resize(arr[i].size());
        for (int j = 0; j < arr[i].size(); j++){
            pref[i][j]=arr[i][j].second.first;
            if (j) pref[i][j]+=pref[i][j-1];
            pos[i][j]=arr[i][j].first;
            ind[i][j]=arr[i][j].second.second;
        }
    }
    //0 decreasing
    //1 increasing
    //2 increasing, \
    but forbidden to profit from back
    //coutarr(X);
    //coutarr(Y);
    //coutarr(W);
    //cout<<M<<endl;
    dp.resize(Y.size(),vector<ll>(3,-1));
    return f(M,2);
}

Compilation message

fish.cpp:162:5: warning: multi-line comment [-Wcomment]
  162 |     //2 increasing, \
      |     ^
fish.cpp: In function 'int getnextup(int)':
fish.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < pos[xv+1].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~~~~
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < _Y.size(); ++i)
      |                     ~~^~~~~~~~~~~
fish.cpp:141:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |     for (int i = 0; i < Y.size(); i++){
      |                     ~~^~~~~~~~~~
fish.cpp:153:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<long long int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |         for (int j = 0; j < arr[i].size(); j++){
      |                         ~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 61560 KB Output is correct
2 Correct 128 ms 70720 KB Output is correct
3 Correct 75 ms 48452 KB Output is correct
4 Correct 68 ms 48444 KB Output is correct
5 Correct 521 ms 95232 KB Output is correct
6 Correct 336 ms 89624 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1083 ms 72076 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 48436 KB Output is correct
2 Correct 60 ms 48372 KB Output is correct
3 Correct 70 ms 44868 KB Output is correct
4 Correct 78 ms 49304 KB Output is correct
5 Correct 83 ms 50796 KB Output is correct
6 Correct 80 ms 50748 KB Output is correct
7 Correct 91 ms 50692 KB Output is correct
8 Correct 87 ms 50724 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 340 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct

Subtask #5
21.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 340 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 54 ms 6468 KB Output is correct
18 Correct 56 ms 7232 KB Output is correct
19 Correct 37 ms 6988 KB Output is correct
20 Correct 38 ms 6972 KB Output is correct
21 Correct 44 ms 7028 KB Output is correct
22 Correct 139 ms 13372 KB Output is correct
23 Correct 7 ms 1748 KB Output is correct
24 Correct 30 ms 4436 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 10 ms 1620 KB Output is correct

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 340 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 54 ms 6468 KB Output is correct
18 Correct 56 ms 7232 KB Output is correct
19 Correct 37 ms 6988 KB Output is correct
20 Correct 38 ms 6972 KB Output is correct
21 Correct 44 ms 7028 KB Output is correct
22 Correct 139 ms 13372 KB Output is correct
23 Correct 7 ms 1748 KB Output is correct
24 Correct 30 ms 4436 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 10 ms 1620 KB Output is correct
27 Correct 4 ms 2132 KB Output is correct
28 Correct 425 ms 30916 KB Output is correct
29 Execution timed out 1086 ms 43264 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 48436 KB Output is correct
2 Correct 60 ms 48372 KB Output is correct
3 Correct 70 ms 44868 KB Output is correct
4 Correct 78 ms 49304 KB Output is correct
5 Correct 83 ms 50796 KB Output is correct
6 Correct 80 ms 50748 KB Output is correct
7 Correct 91 ms 50692 KB Output is correct
8 Correct 87 ms 50724 KB Output is correct
9 Correct 179 ms 62312 KB Output is correct
10 Correct 74 ms 32412 KB Output is correct
11 Correct 176 ms 64652 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 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 1 ms 212 KB Output is correct
18 Correct 68 ms 48328 KB Output is correct
19 Correct 79 ms 48404 KB Output is correct
20 Correct 61 ms 48436 KB Output is correct
21 Correct 67 ms 48440 KB Output is correct
22 Correct 164 ms 61088 KB Output is correct
23 Correct 247 ms 72732 KB Output is correct
24 Correct 230 ms 73252 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 61560 KB Output is correct
2 Correct 128 ms 70720 KB Output is correct
3 Correct 75 ms 48452 KB Output is correct
4 Correct 68 ms 48444 KB Output is correct
5 Correct 521 ms 95232 KB Output is correct
6 Correct 336 ms 89624 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Execution timed out 1083 ms 72076 KB Time limit exceeded
9 Halted 0 ms 0 KB -