oj.uz

답안 #651039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651039 2022-10-16T14:39:10 Z NaimSS 메기 농장 (IOI22_fish) C++17
100 / 100
 456 ms 118132 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define pb push_back
const int N = 100100;
typedef long long ll;
typedef pair<ll,ll> pll;
vector<pll> dp[N][2];
vector<pll> suf[N];
vector<pll> pref[N];

vector<int> posi[N];
vector<int> ys[N];
vector<pll> peixes[N];
vector<pll> peixesSum[N];
const ll inf = 1e18;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
  for(auto &it : Y)it++;
  rep(i,0,M){
    peixes[X[i]].pb(pll(Y[i],W[i]));
    ys[X[i]].pb(Y[i]);
  }

  for(int i=0;i<N;i++){
    sort(all(peixes[i]));
    rep(j,0,sz(peixes[i])){
      peixesSum[i].pb(peixes[i][j]);
      if(j)peixesSum[i][j].ss+=peixesSum[i][j-1].ss;
    }
    posi[i].pb(0);
    if(i)for(auto it : ys[i-1]){
      posi[i].pb(it);
    }
    if(i+1<N)for(auto it : ys[i+1]){
      posi[i].pb(it);
    }
    Unique(posi[i]);
  }



  for(int i=0;i<N;i++){
    
    // calc my dp

    for(int j=0;j<2;j++){

      if(j == 0){
        // subindo!
        // h(i-1) <= h(i).
        // pego um prefixo + valores dos peixes do anterior
        ll val=0;
        int pt=0;
        int ptPref=0;
        for(auto it : posi[i]){
          if(i == 0){
            dp[i][j].pb(pll(it,0));
            continue;
          }
          while(pt < sz(peixes[i-1]) && peixes[i-1][pt].ff<=it){
            val+=peixes[i-1][pt].ss;
            pt++;
          }
          while(ptPref + 1 < sz(pref[i-1]) && pref[i-1][ptPref+1].ff <= it)
            ptPref++;
          dp[i][j].pb(pll(it,pref[i-1][ptPref].ss + val));

        }

      }else{
        // descendo
        // h(i-1) >= h[i]
        // pega sufixo - valores dos meus peixes
        ll val=0;
        int pt=0;
        for(auto it : posi[i]){
          if(i == 0){
            dp[i][j].pb(pll(it,0));
            continue;
          }
          while(pt < sz(peixes[i]) && peixes[i][pt].ff<=it){
            val-=peixes[i][pt].ss;
            pt++;
          }
          auto ItSuf = lower_bound(all(suf[i-1]),pll(it,-inf));
          if(ItSuf == suf[i-1].end()){
            dp[i][j].pb(pll(it,0));
          }else{
            dp[i][j].pb(pll(it,val + ItSuf->ss));
          }
        }
      }

    }
    // calc pref -> subtrair os peixes de i

    ll val=0;
    int pt=0;
    for(auto it : dp[i][0]){
      while(pt < sz(peixes[i]) && peixes[i][pt].ff <= it.ff){
        val+=peixes[i][pt].ss;
        pt++;
      }
      pref[i].pb(pll(it.ff,it.ss - val));
    }
    // pref[i][0]: pode ter ignorado tudo tb:
    if(i){
      rep(j,0,sz(dp[i-1][0])){
        ll v = max(dp[i-1][0][j].ss,dp[i-1][1][j].ss);
        pref[i][0].ss = max(pref[i][0].ss,v);
      }
    }

    for(int j=1;j<sz(pref[i]);j++){
      pref[i][j].ss = max(pref[i][j].ss,pref[i][j-1].ss);
    }

    // calc suf -> somar peixes de i+1
    int K = 0;
    for(auto it : dp[i][1]){
      ll peixesNext = 0;
      if(i+1<N){
        int pos = upper_bound(all(peixes[i+1]),pll(it.ff,inf)) - peixes[i+1].begin() - 1;
        if(pos >= 0)peixesNext = peixesSum[i+1][pos].ss;
      }
      suf[i].pb(pll(it.ff,max(it.ss,dp[i][0][K].ss) + peixesNext));
      K++;
    }

    for(int j=sz(suf[i])-2;j>=0;j--){
      suf[i][j].ss = max(suf[i][j].ss,suf[i][j+1].ss);
    }
    
    continue;
    cout << "=========\n";
    rep(j,0,2){
      cout << i<<" "<<j<<endl;
      for(auto it : dp[i][j])cout << it.ff<<" "<<it.ss<<endl;


    }
      // pref:
      cout << "Pref\n";
      for(auto it : pref[i]){
        cout << it.ff<<" "<<it.ss<<endl;
      }
      cout << "Suf\n";
      for(auto it : suf[i]){
        cout << it.ff<<" "<<it.ss<<endl;
      }

    cout << "\n";

  }
  
  ll res=0;
  rep(j,0,2)for(auto it : dp[N-1][j])res=max(res,it.ss);
  return res;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 43484 KB Output is correct
2 Correct 96 ms 47412 KB Output is correct
3 Correct 42 ms 34656 KB Output is correct
4 Correct 41 ms 34696 KB Output is correct
5 Correct 290 ms 94336 KB Output is correct
6 Correct 363 ms 113356 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19104 KB Output is correct
2 Correct 165 ms 59640 KB Output is correct
3 Correct 186 ms 66816 KB Output is correct
4 Correct 86 ms 43456 KB Output is correct
5 Correct 104 ms 47428 KB Output is correct
6 Correct 11 ms 19080 KB Output is correct
7 Correct 11 ms 19156 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 11 ms 19108 KB Output is correct
10 Correct 39 ms 34860 KB Output is correct
11 Correct 39 ms 34700 KB Output is correct
12 Correct 124 ms 48968 KB Output is correct
13 Correct 128 ms 53988 KB Output is correct
14 Correct 98 ms 46372 KB Output is correct
15 Correct 105 ms 49384 KB Output is correct
16 Correct 106 ms 46324 KB Output is correct
17 Correct 102 ms 49348 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 34696 KB Output is correct
2 Correct 42 ms 34696 KB Output is correct
3 Correct 118 ms 43048 KB Output is correct
4 Correct 83 ms 41588 KB Output is correct
5 Correct 167 ms 53968 KB Output is correct
6 Correct 148 ms 53576 KB Output is correct
7 Correct 181 ms 53992 KB Output is correct
8 Correct 158 ms 54072 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 11 ms 19036 KB Output is correct
4 Correct 13 ms 19028 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19060 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 15 ms 19156 KB Output is correct
10 Correct 18 ms 19568 KB Output is correct
11 Correct 13 ms 19296 KB Output is correct
12 Correct 13 ms 19412 KB Output is correct
13 Correct 12 ms 19028 KB Output is correct
14 Correct 14 ms 19292 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 11 ms 19036 KB Output is correct
4 Correct 13 ms 19028 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19060 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 15 ms 19156 KB Output is correct
10 Correct 18 ms 19568 KB Output is correct
11 Correct 13 ms 19296 KB Output is correct
12 Correct 13 ms 19412 KB Output is correct
13 Correct 12 ms 19028 KB Output is correct
14 Correct 14 ms 19292 KB Output is correct
15 Correct 14 ms 19248 KB Output is correct
16 Correct 16 ms 19560 KB Output is correct
17 Correct 54 ms 29144 KB Output is correct
18 Correct 41 ms 30044 KB Output is correct
19 Correct 46 ms 30000 KB Output is correct
20 Correct 39 ms 29176 KB Output is correct
21 Correct 40 ms 29064 KB Output is correct
22 Correct 74 ms 39144 KB Output is correct
23 Correct 19 ms 21332 KB Output is correct
24 Correct 48 ms 26700 KB Output is correct
25 Correct 12 ms 19412 KB Output is correct
26 Correct 17 ms 21000 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 11 ms 19036 KB Output is correct
4 Correct 13 ms 19028 KB Output is correct
5 Correct 12 ms 19156 KB Output is correct
6 Correct 12 ms 19060 KB Output is correct
7 Correct 12 ms 19028 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 15 ms 19156 KB Output is correct
10 Correct 18 ms 19568 KB Output is correct
11 Correct 13 ms 19296 KB Output is correct
12 Correct 13 ms 19412 KB Output is correct
13 Correct 12 ms 19028 KB Output is correct
14 Correct 14 ms 19292 KB Output is correct
15 Correct 14 ms 19248 KB Output is correct
16 Correct 16 ms 19560 KB Output is correct
17 Correct 54 ms 29144 KB Output is correct
18 Correct 41 ms 30044 KB Output is correct
19 Correct 46 ms 30000 KB Output is correct
20 Correct 39 ms 29176 KB Output is correct
21 Correct 40 ms 29064 KB Output is correct
22 Correct 74 ms 39144 KB Output is correct
23 Correct 19 ms 21332 KB Output is correct
24 Correct 48 ms 26700 KB Output is correct
25 Correct 12 ms 19412 KB Output is correct
26 Correct 17 ms 21000 KB Output is correct
27 Correct 14 ms 20404 KB Output is correct
28 Correct 162 ms 65176 KB Output is correct
29 Correct 241 ms 81384 KB Output is correct
30 Correct 243 ms 97260 KB Output is correct
31 Correct 246 ms 97348 KB Output is correct
32 Correct 202 ms 80320 KB Output is correct
33 Correct 258 ms 97344 KB Output is correct
34 Correct 248 ms 96700 KB Output is correct
35 Correct 100 ms 50168 KB Output is correct
36 Correct 260 ms 89192 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 34696 KB Output is correct
2 Correct 42 ms 34696 KB Output is correct
3 Correct 118 ms 43048 KB Output is correct
4 Correct 83 ms 41588 KB Output is correct
5 Correct 167 ms 53968 KB Output is correct
6 Correct 148 ms 53576 KB Output is correct
7 Correct 181 ms 53992 KB Output is correct
8 Correct 158 ms 54072 KB Output is correct
9 Correct 155 ms 65908 KB Output is correct
10 Correct 111 ms 47276 KB Output is correct
11 Correct 239 ms 75972 KB Output is correct
12 Correct 10 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19020 KB Output is correct
15 Correct 10 ms 19020 KB Output is correct
16 Correct 10 ms 19028 KB Output is correct
17 Correct 11 ms 19024 KB Output is correct
18 Correct 40 ms 34732 KB Output is correct
19 Correct 49 ms 34732 KB Output is correct
20 Correct 41 ms 34652 KB Output is correct
21 Correct 37 ms 34720 KB Output is correct
22 Correct 211 ms 62596 KB Output is correct
23 Correct 292 ms 88300 KB Output is correct
24 Correct 297 ms 94776 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 43484 KB Output is correct
2 Correct 96 ms 47412 KB Output is correct
3 Correct 42 ms 34656 KB Output is correct
4 Correct 41 ms 34696 KB Output is correct
5 Correct 290 ms 94336 KB Output is correct
6 Correct 363 ms 113356 KB Output is correct
7 Correct 11 ms 19104 KB Output is correct
8 Correct 165 ms 59640 KB Output is correct
9 Correct 186 ms 66816 KB Output is correct
10 Correct 86 ms 43456 KB Output is correct
11 Correct 104 ms 47428 KB Output is correct
12 Correct 11 ms 19080 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 11 ms 19108 KB Output is correct
16 Correct 39 ms 34860 KB Output is correct
17 Correct 39 ms 34700 KB Output is correct
18 Correct 124 ms 48968 KB Output is correct
19 Correct 128 ms 53988 KB Output is correct
20 Correct 98 ms 46372 KB Output is correct
21 Correct 105 ms 49384 KB Output is correct
22 Correct 106 ms 46324 KB Output is correct
23 Correct 102 ms 49348 KB Output is correct
24 Correct 41 ms 34696 KB Output is correct
25 Correct 42 ms 34696 KB Output is correct
26 Correct 118 ms 43048 KB Output is correct
27 Correct 83 ms 41588 KB Output is correct
28 Correct 167 ms 53968 KB Output is correct
29 Correct 148 ms 53576 KB Output is correct
30 Correct 181 ms 53992 KB Output is correct
31 Correct 158 ms 54072 KB Output is correct
32 Correct 11 ms 19028 KB Output is correct
33 Correct 11 ms 19028 KB Output is correct
34 Correct 11 ms 19036 KB Output is correct
35 Correct 13 ms 19028 KB Output is correct
36 Correct 12 ms 19156 KB Output is correct
37 Correct 12 ms 19060 KB Output is correct
38 Correct 12 ms 19028 KB Output is correct
39 Correct 12 ms 19028 KB Output is correct
40 Correct 15 ms 19156 KB Output is correct
41 Correct 18 ms 19568 KB Output is correct
42 Correct 13 ms 19296 KB Output is correct
43 Correct 13 ms 19412 KB Output is correct
44 Correct 12 ms 19028 KB Output is correct
45 Correct 14 ms 19292 KB Output is correct
46 Correct 14 ms 19248 KB Output is correct
47 Correct 16 ms 19560 KB Output is correct
48 Correct 54 ms 29144 KB Output is correct
49 Correct 41 ms 30044 KB Output is correct
50 Correct 46 ms 30000 KB Output is correct
51 Correct 39 ms 29176 KB Output is correct
52 Correct 40 ms 29064 KB Output is correct
53 Correct 74 ms 39144 KB Output is correct
54 Correct 19 ms 21332 KB Output is correct
55 Correct 48 ms 26700 KB Output is correct
56 Correct 12 ms 19412 KB Output is correct
57 Correct 17 ms 21000 KB Output is correct
58 Correct 14 ms 20404 KB Output is correct
59 Correct 162 ms 65176 KB Output is correct
60 Correct 241 ms 81384 KB Output is correct
61 Correct 243 ms 97260 KB Output is correct
62 Correct 246 ms 97348 KB Output is correct
63 Correct 202 ms 80320 KB Output is correct
64 Correct 258 ms 97344 KB Output is correct
65 Correct 248 ms 96700 KB Output is correct
66 Correct 100 ms 50168 KB Output is correct
67 Correct 260 ms 89192 KB Output is correct
68 Correct 155 ms 65908 KB Output is correct
69 Correct 111 ms 47276 KB Output is correct
70 Correct 239 ms 75972 KB Output is correct
71 Correct 10 ms 19028 KB Output is correct
72 Correct 10 ms 19028 KB Output is correct
73 Correct 10 ms 19020 KB Output is correct
74 Correct 10 ms 19020 KB Output is correct
75 Correct 10 ms 19028 KB Output is correct
76 Correct 11 ms 19024 KB Output is correct
77 Correct 40 ms 34732 KB Output is correct
78 Correct 49 ms 34732 KB Output is correct
79 Correct 41 ms 34652 KB Output is correct
80 Correct 37 ms 34720 KB Output is correct
81 Correct 211 ms 62596 KB Output is correct
82 Correct 292 ms 88300 KB Output is correct
83 Correct 297 ms 94776 KB Output is correct
84 Correct 298 ms 96212 KB Output is correct
85 Correct 332 ms 96000 KB Output is correct
86 Correct 456 ms 116608 KB Output is correct
87 Correct 433 ms 117492 KB Output is correct
88 Correct 10 ms 19028 KB Output is correct
89 Correct 447 ms 118132 KB Output is correct
90 Correct 363 ms 109516 KB Output is correct
91 Correct 269 ms 97696 KB Output is correct