oj.uz

답안 #127789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127789 2019-07-10T06:09:57 Z RockyB Worst Reporter 3 (JOI18_worst_reporter3) C++17
0 / 100
 1904 ms 76112 KB 
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back

#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

#define rep(a, b, c) for (int a = (b); (a) <= (c); ++a)
#define per(a, b, c) for (int a = (b); (a) >= (c); --a) 

#define nl '\n'
#define ioi exit(0);

using namespace std;

typedef long long ll;

const int MAX_N = (int)5e5 + 7;

int n, q;
int d[MAX_N], l[MAX_N], r[MAX_N], t[MAX_N], ans[MAX_N];

map <int, vector <int> > off;

vector <int> d1;

struct fenwick {
  pair <ll, int> f[MAX_N];

  void upd(int p, ll df, int t) {
    for (; p < MAX_N; p |= p + 1) {
      f[p].f += df;
      f[p].s += t;
    }
  }
  pair <ll, int> get(int p) {
    pair <ll, int> res = {0, 0};
    for (; p >= 0; p = (p & (p + 1)) - 1) {
      res.f += f[p].f;
      res.s += f[p].s;
    }
    return res;
  }
} F; 

pair <ll, int> pref[MAX_N];

int S = -1, E = -1;

pair <int, int> inter(pair <int, int> x, pair <int, int> y) {
  return {max(x.f, y.f), min(x.s, y.s)};
}
ll get_val(int p, int T) {
  pair <ll, int> cur = F.get(p);
  int one = p - cur.s; 
  if (S != -1) {
    pair <int, int> rng = inter({1, p}, {S, E});
    if (rng.f <= rng.s) {
      // cerr << cur.f << ' ' << one << nl;
      one -= pref[rng.s].s - pref[rng.f - 1].s;
      cur.f += pref[rng.s].f - pref[rng.f - 1].f;
    }
  }


  return T - (cur.f + one);
}

void solve(int T, vector <int> &qr) {
  vector <int> a;
  int add = T;

  vector < pair <int, ll > > del;
  S = -1, E = -1;
  for (auto i : d1) {
    int df = (d[i] + d[i - 1] - 1) / d[i - 1];
    if (add == 1 && S == -1) S = i;
    
    if (S == -1) {
      F.upd(i, 1 + d[i - 1] * (add % df), 1);
      del.pb({i, 1 + d[i - 1] * (add % df)});
    }

    // cerr << 1 + d[i - 1] * (add % df) << ' ';
    add /= d[i];
    if (!add) {
      E = i;
      break;
    }
  }
  if (E == -1) E = n;
  /* cerr << nl;
  cerr << get_val(2, T);
  ioi */
  /* rep(i, 1, n) {
    cerr << get_val(i, T) << ' ';
  } 
  ioi */
  // cout << nl;

  for (auto it : qr) {
    int L = 0, R = n;
    int lo = 1, hi = n;
    while (lo <= hi) {
      int mid = lo + hi >> 1;
      if (get_val(mid, T) >= l[it]) L = mid, lo = mid + 1;
      else hi = mid - 1;
    }
    lo = 1, hi = n;
    while (lo <= hi) {
      int mid = lo + hi >> 1;
      if (get_val(mid, T) <= r[it]) R = mid, hi = mid - 1;
      else lo = mid + 1;
    }
    if (R <= L) ans[it] += L - R + 1;
    if (l[it] <= T && T <= r[it]) ans[it]++;
    //ans[it] = upper_bound(all(a), R) - lower_bound(all(a), L);
  }

  // cout << ans[2] << nl;
  for (auto it : del) {
    F.upd(it.f, -it.s, -1);
  }
}
int main() {
  #ifdef IOI
    freopen ("in.txt", "r", stdin);
  #endif
  ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> q;
  d[0] = 1;
  rep(i, 1, n) {
    cin >> d[i];
    if (d[i] > 1) d1.pb(i);

    int df = (d[i] + d[i - 1] - 1) / d[i - 1];
    pref[i] = pref[i - 1];
    if (df > 1) pref[i].f += 1 + d[i - 1], pref[i].s++;
  }
  rep(i, 1, q) {
    cin >> t[i] >> l[i] >> r[i];
    off[t[i]].pb(i);
  }

  /* solve(2, off[2]);
  ioi
 */
  for (auto it : off) {
    solve(it.f, it.s);  
  }

  rep(i, 1, q) {
    cout << ans[i] << nl;
  }

  ioi
}

Compilation message

worst_reporter3.cpp: In function 'void solve(int, std::vector<int>&)':
worst_reporter3.cpp:109:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int mid = lo + hi >> 1;
                 ~~~^~~~
worst_reporter3.cpp:115:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
       int mid = lo + hi >> 1;
                 ~~~^~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1904 ms 76112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1904 ms 76112 KB Output isn't correct
2 Halted 0 ms 0 KB -