oj.uz

Submission #1010715

# Submission time Handle Problem Language Result Execution time Memory
1010715 2024-06-29T09:54:35 Z mychecksedad Fish 3 (JOI24_fish3) C++17
100 / 100
 493 ms 142536 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 3e5+100, M = 1e5+10, K = 20, MX = 30;


int  n, q, to[N][K];
ll D, C[N], B[N], suf[N], arr[N], rmq[N][K], pref[N], S[N], dp[N][K];
ll get(int l, int r){
  int k= log2(r-l+1);
  return min(rmq[l][k], rmq[r-(1<<k)+1][k]);
}
void solve(){
  cin >> n >> D;
  for(int i = 1; i <= n; ++i) cin >> C[i];
  B[1] = C[1] % D;
  for(int i = 2; i <= n; ++i){
    if(C[i] % D >= C[i-1] % D){
      B[i] = B[i-1] + (C[i]%D) - (C[i-1]%D);
    }else{
      B[i] = B[i-1] + D + (C[i]%D) - (C[i-1]%D);
    }
  }
  for(int i = 1; i <= n; ++i) arr[i] = rmq[i][0] = C[i] - B[i];

  for(int j = 1; j < K  ;++j){
    for(int i = 1; i + (1<<j) <= n+1; ++i){
      rmq[i][j] = min(rmq[i][j - 1], rmq[i+(1<<(j-1))][j-1]);
    }
  }


  pref[0] = 0;
  S[0] = 0;
  C[0] = arr[0] = 0;
  for(int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + B[i];
  for(int i = 1; i <= n; ++i) S[i] = S[i - 1] + C[i];
  

  vector<int> Q;
  to[1][0] = 0;
  dp[1][0] = arr[1] * (1 - to[1][0]);
  Q.pb(1);
  for(int i = 2; i <= n; ++i){
    while(!Q.empty() && arr[Q.back()] > arr[i]) Q.pop_back();
    if(Q.empty()) to[i][0] = 0;
    else to[i][0] = Q.back();
    dp[i][0] = arr[i] * (i - to[i][0]);
    Q.pb(i);
  }
  for(int j = 1; j < K; ++j) for(int i = 1; i <= n; ++i){
    dp[i][j] = dp[i][j - 1] + dp[to[i][j - 1]][j - 1];
    to[i][j] = to[to[i][j - 1]][j - 1];
  }

  cin >> q;
  for(int i = 1; i <= q; ++i){
    int l, r; cin >> l >> r;
    ll ans = 0;
    ll mn = get(l, r);
    ll R = B[l] - (C[l]%D);
    if(mn + R < 0){
      cout << -1 << '\n';
      continue;
    }
    ans = (S[r] - S[l-1]) - (pref[r] - pref[l-1]);
    int p = r;
    for(int j = K-1; j >= 0; --j){
      if(to[p][j] >= l){
        ans -= dp[p][j];
        p = to[p][j];
      }
    }
    ans -= (p-l+1)*arr[p];
    cout << ans / D << '\n';
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:88:15: warning: unused variable 'aa' [-Wunused-variable]
   88 |   int tt = 1, aa;
      |               ^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 472 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 2012 KB Output is correct
6 Correct 2 ms 1248 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 136500 KB Output is correct
2 Correct 412 ms 136268 KB Output is correct
3 Correct 49 ms 4688 KB Output is correct
4 Correct 199 ms 134996 KB Output is correct
5 Correct 212 ms 134992 KB Output is correct
6 Correct 342 ms 135324 KB Output is correct
7 Correct 347 ms 135320 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 8456 KB Output is correct
2 Correct 242 ms 142420 KB Output is correct
3 Correct 235 ms 142416 KB Output is correct
4 Correct 265 ms 142536 KB Output is correct
5 Correct 239 ms 142420 KB Output is correct
6 Correct 276 ms 136372 KB Output is correct
7 Correct 275 ms 136432 KB Output is correct
8 Correct 303 ms 139616 KB Output is correct
9 Correct 289 ms 139604 KB Output is correct
10 Correct 430 ms 139192 KB Output is correct
11 Correct 493 ms 139176 KB Output is correct
12 Correct 391 ms 141520 KB Output is correct
13 Correct 383 ms 141608 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 113752 KB Output is correct
2 Correct 267 ms 136020 KB Output is correct
3 Correct 130 ms 34588 KB Output is correct
4 Correct 282 ms 139348 KB Output is correct
5 Correct 210 ms 126288 KB Output is correct
6 Correct 231 ms 142420 KB Output is correct
7 Correct 209 ms 114160 KB Output is correct
8 Correct 236 ms 142396 KB Output is correct
9 Correct 256 ms 135504 KB Output is correct
10 Correct 222 ms 135216 KB Output is correct
11 Correct 294 ms 139296 KB Output is correct
12 Correct 260 ms 138580 KB Output is correct
13 Correct 218 ms 142416 KB Output is correct
14 Correct 212 ms 138064 KB Output is correct
15 Correct 287 ms 141700 KB Output is correct
16 Correct 207 ms 137812 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 472 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 2012 KB Output is correct
6 Correct 2 ms 1248 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 2 ms 1628 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 389 ms 136500 KB Output is correct
15 Correct 412 ms 136268 KB Output is correct
16 Correct 49 ms 4688 KB Output is correct
17 Correct 199 ms 134996 KB Output is correct
18 Correct 212 ms 134992 KB Output is correct
19 Correct 342 ms 135324 KB Output is correct
20 Correct 347 ms 135320 KB Output is correct
21 Correct 62 ms 8456 KB Output is correct
22 Correct 242 ms 142420 KB Output is correct
23 Correct 235 ms 142416 KB Output is correct
24 Correct 265 ms 142536 KB Output is correct
25 Correct 239 ms 142420 KB Output is correct
26 Correct 276 ms 136372 KB Output is correct
27 Correct 275 ms 136432 KB Output is correct
28 Correct 303 ms 139616 KB Output is correct
29 Correct 289 ms 139604 KB Output is correct
30 Correct 430 ms 139192 KB Output is correct
31 Correct 493 ms 139176 KB Output is correct
32 Correct 391 ms 141520 KB Output is correct
33 Correct 383 ms 141608 KB Output is correct
34 Correct 238 ms 113752 KB Output is correct
35 Correct 267 ms 136020 KB Output is correct
36 Correct 130 ms 34588 KB Output is correct
37 Correct 282 ms 139348 KB Output is correct
38 Correct 210 ms 126288 KB Output is correct
39 Correct 231 ms 142420 KB Output is correct
40 Correct 209 ms 114160 KB Output is correct
41 Correct 236 ms 142396 KB Output is correct
42 Correct 256 ms 135504 KB Output is correct
43 Correct 222 ms 135216 KB Output is correct
44 Correct 294 ms 139296 KB Output is correct
45 Correct 260 ms 138580 KB Output is correct
46 Correct 218 ms 142416 KB Output is correct
47 Correct 212 ms 138064 KB Output is correct
48 Correct 287 ms 141700 KB Output is correct
49 Correct 207 ms 137812 KB Output is correct
50 Correct 239 ms 142084 KB Output is correct
51 Correct 277 ms 136276 KB Output is correct
52 Correct 283 ms 139092 KB Output is correct
53 Correct 453 ms 138592 KB Output is correct
54 Correct 377 ms 141012 KB Output is correct
55 Correct 248 ms 141904 KB Output is correct
56 Correct 205 ms 137552 KB Output is correct
57 Correct 198 ms 134756 KB Output is correct
58 Correct 204 ms 134744 KB Output is correct
59 Correct 282 ms 139860 KB Output is correct
60 Correct 221 ms 137652 KB Output is correct
61 Correct 427 ms 138692 KB Output is correct
62 Correct 461 ms 138492 KB Output is correct
63 Correct 410 ms 140728 KB Output is correct
64 Correct 221 ms 137676 KB Output is correct