oj.uz

Submission #721330

# Submission time Handle Problem Language Result Execution time Memory
721330 2023-04-10T17:06:38 Z Yell0 Catfish Farm (IOI22_fish) C++17
23 / 100
 173 ms 22804 KB 
#include <bits/stdc++.h>
#define r first
#define w second
 
using namespace std;
typedef long long ll;
typedef pair<int,ll> pii;
const int MN=1e5+2;

ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W) {
  vector<vector<pii>> fish(N+2);
  for(int i=0;i<M;++i) fish[X[i]+1].push_back({Y[i]+1,(ll)W[i]});

  fish[0].push_back({0,0LL});
  fish[N+1].push_back({0,0LL});
  for(int i=1;i<=N;++i) {
    fish[i].push_back({0,0LL});
    sort(fish[i].begin(),fish[i].end());
    for(int j=1;j<(int)fish[i].size();++j) fish[i][j].w+=fish[i][j-1].w;
  }

  auto pfx=[&](int c,int r) {
    return (--upper_bound(fish[c].begin(),fish[c].end(),pii(r,INT_MAX)))->w;
  };

  vector<vector<int>> stops(N+2);
  stops[0].push_back(0);
  stops[N+1].push_back(0);
  for(int i=1;i<=N;++i) {
    for(pii f:fish[i-1]) stops[i].push_back(f.r);
    for(pii f:fish[i+1]) stops[i].push_back(f.r);
    sort(stops[i].begin(),stops[i].end());
    stops[i].erase(unique(stops[i].begin(),stops[i].end()),stops[i].end());
  }

  vector<ll> dp[2];
  dp[0]={0LL};
  dp[1]={0LL};
  for(int i=1;i<=N+1;++i) {
    vector<ll> ndp[2];
    ll pf=0,sf=0;
    int pfi=0,sfi=(int)stops[i-1].size()-1;
    for(int s=0;s<(int)stops[i].size();++s) {
      while(pfi<(int)stops[i-1].size()&&stops[i-1][pfi]<=stops[i][s]) {
        pf=max(pf,dp[0][pfi]-pfx(i-1,stops[i-1][pfi]));
        ++pfi;
      }
      ndp[0].push_back(max(dp[1][0],pf+pfx(i-1,stops[i][s])));
    }
    for(int s=(int)stops[i].size()-1;s>=0;--s) {
      while(sfi>=0&&stops[i-1][sfi]>=stops[i][s]) {
        sf=max(sf,max(dp[0][sfi],dp[1][sfi])+pfx(i,stops[i-1][sfi]));
        --sfi;
      }
      ndp[1].push_back(sf-pfx(i,stops[i][s]));
    }
    reverse(ndp[1].begin(),ndp[1].end());
    dp[0].clear();
    dp[1].clear();
    for(ll x:ndp[0]) dp[0].push_back(x);
    for(ll x:ndp[1]) dp[1].push_back(x);
  }

  return max(dp[0][0],dp[1][0]);
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 134 ms 21024 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40604505946872'
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11216 KB Output is correct
2 Correct 29 ms 11248 KB Output is correct
3 Correct 55 ms 12444 KB Output is correct
4 Correct 52 ms 12748 KB Output is correct
5 Correct 94 ms 15664 KB Output is correct
6 Correct 80 ms 15556 KB Output is correct
7 Correct 90 ms 15612 KB Output is correct
8 Correct 95 ms 15684 KB Output is correct

Subtask #4
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 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 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 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '182899577878'
10 Halted 0 ms 0 KB -

Subtask #5
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 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 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 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '182899577878'
10 Halted 0 ms 0 KB -

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 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 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 Incorrect 1 ms 340 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '182899577878'
10 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11216 KB Output is correct
2 Correct 29 ms 11248 KB Output is correct
3 Correct 55 ms 12444 KB Output is correct
4 Correct 52 ms 12748 KB Output is correct
5 Correct 94 ms 15664 KB Output is correct
6 Correct 80 ms 15556 KB Output is correct
7 Correct 90 ms 15612 KB Output is correct
8 Correct 95 ms 15684 KB Output is correct
9 Correct 101 ms 15564 KB Output is correct
10 Correct 69 ms 11544 KB Output is correct
11 Correct 150 ms 22804 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 27 ms 11216 KB Output is correct
19 Correct 29 ms 11220 KB Output is correct
20 Correct 27 ms 11268 KB Output is correct
21 Correct 26 ms 11264 KB Output is correct
22 Correct 99 ms 16172 KB Output is correct
23 Correct 167 ms 22740 KB Output is correct
24 Correct 173 ms 22748 KB Output is correct

Subtask #8
0 / 16.0

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