제출 #1290956

#제출 시각아이디문제언어결과실행 시간메모리
1290956LIASimple game (IZhO17_game)C++17
0 / 100
9 ms15928 KiB
// // Created by liasa on 14/11/2025. // #include <bits/stdc++.h> using namespace std; #define ll long long #define vll vector<ll> struct Seg { vll seg; ll sz = 1; Seg(ll n) { for (; sz < n; sz *= 2) ; seg.resize(2 * sz); } void up(ll x, ll v) { x += sz; seg[x] += v; for (x /= 2; x > 0; x /= 2) seg[x] = seg[x * 2] + seg[x * 2 + 1]; } ll q(ll l, ll r) { l += sz, r += sz; ll ans = 0; while (l <= r) { if ((l & 1)) ans += seg[l++]; if (!(r & 1)) ans += seg[r--]; l /= 2; r /= 2; } return ans; } }; int main() { ll n, m; cin >> n >> m; vll h(n); ll sz = 1e6+1; vll upd(sz + 1); for (ll i = 0; i < n; ++i) { cin >> h[i]; if (i != 0) { ll a = h[i - 1], b = h[i]; if (a > b) swap(a, b); upd[a]++; upd[b]--; } } vll pre(sz + 1); pre[0] = upd[0]; for (ll i = 1; i < sz; ++i) pre[i] = pre[i - 1] + upd[i]; while (m--) { ll t, y; cin >> t >> y; cout << pre[y] << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...