oj.uz

Submission #106315

# Submission time Handle Problem Language Result Execution time Memory
106315 2019-04-17T21:04:49 Z xiaowuc1 Watering can (POI13_kon) C++14
0 / 100
 401 ms 13220 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_RAGETREE_SZ = 300005;

int ragetreesum[4 * MAX_RAGETREE_SZ];
int ragetreemin[4 * MAX_RAGETREE_SZ];
int ragetreelazy[4 * MAX_RAGETREE_SZ];
int n;

void pushdown(int idx) {
  ragetreelazy[2*idx] += ragetreelazy[idx];
  ragetreelazy[2*idx+1] += ragetreelazy[idx];
  ragetreelazy[idx] = 0;
}
void pullup(int idx) {
  ragetreesum[idx] = ragetreesum[2*idx] + ragetreesum[2*idx+1];
  ragetreemin[idx] = min(ragetreemin[2*idx] + ragetreelazy[2*idx], ragetreemin[2*idx+1] + ragetreelazy[2*idx+1]);
}
void ragetreedec(int idx, int lhs, int rhs, int l, int r) {
  if(lhs >= l && rhs <= r && ragetreemin[idx] + ragetreelazy[idx] - 1 > 0) {
    ragetreelazy[idx]--;
    return;
  }
  if(lhs == rhs) {
    ragetreesum[idx]++;
    ragetreemin[idx] = 1e9;
    return;
  }
  pushdown(idx);
  int mid = (lhs+rhs)/2;
  if(mid >= l) ragetreedec(2*idx, lhs, mid, l, r);
  if(mid+1 <= r) ragetreedec(2*idx+1, mid+1, rhs, l, r);
  pullup(idx);
}
int ragetreequery(int idx, int lhs, int rhs, int l, int r) {
  if(lhs >= l && rhs <= r) return ragetreesum[idx];
  int ret = 0;
  int mid = (lhs+rhs)/2;
  if(mid >= l) ret += ragetreequery(2*idx, lhs, mid, l, r);
  if(mid+1 <= r) ret += ragetreequery(2*idx+1, mid+1, rhs, l, r);
  return ret;
}

int k;
void ragetreeinit(int idx, int lhs, int rhs, int *D) {
  if(lhs == rhs) {
    if(D[lhs] >= k) {
      ragetreesum[idx] = 1;
      ragetreemin[idx] = 1e9;
    }
    else {
      ragetreemin[idx] = k - D[lhs];
    }
    return;
  }
  int mid = (lhs+rhs)/2;
  ragetreeinit(2*idx, lhs, mid, D);
  ragetreeinit(2*idx+1, mid+1, rhs, D);
  pullup(idx);
}

void inicjuj(int nn, int kk, int *D) {
  n = nn;
  k = kk;
  for(int i = 0; i < n; i++) D[i] = k - D[i];
  ragetreeinit(1, 0, n-1, D);
}

// inc [a, b] by 1
void podlej(int a, int b) {
  ragetreedec(1, 0, n-1, a, b);
}
// count
int dojrzale(int a, int b) {
  return ragetreequery(1, 0, n-1, a, b);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 1272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 2076 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 114 ms 4052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 299 ms 4732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 242 ms 4684 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 267 ms 8312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 363 ms 13208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 401 ms 13220 KB Output isn't correct
2 Halted 0 ms 0 KB -