Submission #1202695

#TimeUsernameProblemLanguageResultExecution timeMemory
1202695Mher777Street Lamps (APIO19_street_lamps)C++20
20 / 100
105 ms42772 KiB
#include <iostream> #include <iomanip> #include <array> #include <string> #include <algorithm> #include <cmath> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <deque> #include <bitset> #include <list> #include <iterator> #include <numeric> #include <complex> #include <utility> #include <random> #include <cassert> #include <fstream> using namespace std; mt19937 rnd(time(nullptr)); /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef float fl; typedef long double ld; /* -------------------- Usings -------------------- */ using vi = vector<int>; using vll = vector<ll>; using mii = map<int, int>; using mll = map<ll, ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; /* -------------------- Defines -------------------- */ #define ff first #define ss second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define mpr make_pair #define yes cout<<"Yes\n" #define no cout<<"No\n" #define all(x) (x).begin(), (x).end() #define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout); /* -------------------- Constants -------------------- */ const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 }; const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const int MAX = int(1e9 + 5); const ll MAXL = ll(2e18) + 5ll; const ll MOD = ll(1000000007); const ll MOD2 = ll(998244353); /* -------------------- Functions -------------------- */ void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void precision(int x) { cout.setf(ios::fixed | ios::showpoint); cout.precision(x); } ll gcd(ll a, ll b) { if (a == 0 || b == 0) return 0; while (b) { a %= b; swap(a, b); } return a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll range_sum(ll a, ll b) { if (a > b) return 0ll; ll dif = a - 1, cnt = b - a + 1; ll ans = ((b - a + 1) * (b - a + 2)) / 2; ans += ((b - a + 1) * dif); return ans; } string dec_to_bin(ll a) { string s = ""; for (ll i = a; i > 0; ) { ll k = i % 2; i /= 2; char c = k + 48; s += c; } if (a == 0) { s = "0"; } reverse(all(s)); return s; } ll bin_to_dec(string s) { ll num = 0; for (int i = 0; i < s.size(); i++) { num *= 2ll; num += (s[i] - '0'); } return num; } ll factorial_by_mod(ll n, ll mod) { ll ans = 1; ll num; for (ll i = 1; i <= n; ++i) { num = i % mod; ans *= num; ans %= mod; } return ans; } bool isPrime(ll a) { if (a == 1) return false; for (ll i = 2; i * i <= a; i++) { if (a % i == 0) return false; } return true; } ll binpow(ll a, ll b) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; } b >>= 1; a *= a; } return ans; } ll binpow_by_mod(ll a, ll b, ll mod) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; ans %= mod; } b >>= 1; a *= a; a %= mod; } return ans; } /* -------------------- Solution -------------------- */ const int N = 300005, M = 30; int a[N], st[N][M]; int n, q, m, lg; void build_sparse() { for (int lgx = 1; lgx <= lg; ++lgx) { for (int i = 1; i + (1 << lgx) - 1 <= n; ++i) { st[i][lgx] = max(st[i][lgx - 1], st[i + (1 << (lgx - 1))][lgx - 1]); } } } int qry(int l, int r) { int lgx = log2(r - l + 1); return max(st[l][lgx], st[r - (1 << lgx) + 1][lgx]); } void slv() { string s; cin >> n >> q >> s; m = n + 1; lg = log2(n); for (int i = 0; i < n; ++i) { st[i + 1][0] = MAX; a[i + 1] = s[i] - '0'; if (a[i + 1]) { st[i + 1][0] = 0; } } vector<pair<int, pii>> harc(q + 1); for (int i = 1; i <= q; ++i) { cin >> s; if (s[0] == 't') { harc[i].ff = 0; int ind; cin >> ind; harc[i].ss.ff = ind; st[ind][0] = i; continue; } int l, r; cin >> l >> r; harc[i] = { i,{l,r} }; } build_sparse(); for (int i = 1; i <= q; ++i) { if (harc[i].ff == 0) continue; int l = harc[i].ss.ff, r = harc[i].ss.ss; int val = qry(l, r - 1); cout << max(0, i - qry(l, r - 1)) << '\n'; } } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...