Submission #895310

#TimeUsernameProblemLanguageResultExecution timeMemory
895310Mher777Election (BOI18_election)C++17
0 / 100
2 ms2396 KiB
/* ----------------------------- Mher777 ----------------------------- */ #define _CRT_SECURE_NO_WARNINGS #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 <fstream> #include <cassert> using namespace std; /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef float fl; typedef double db; 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() /* -------------------- Constants -------------------- */ const int MAX = int(1e9 + 5); const ll MAXL = ll(1e18 + 5); const ll MOD = ll(1e9 + 7); 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) { 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) { 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; } int isPrime(ll a) { if (a == 1) return 0; for (ll i = 2; i * i <= a; i++) { if (a % i == 0) return 0; } return 1; } 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 = 500005; int n, q; string s; pii t[N * 4], t_rev[N * 4];//first->C-T,second->ans pii merge(pii a, pii b) { return { b.ff + max(0,a.ff - b.ss),a.ss + max(0,b.ss - a.ff) }; } void bld(int l = 0, int r = n - 1, int pos = 1) { if (l == r) { if (s[l] == 'C') { t[pos] = { 1,0 }; t_rev[pos] = { 1,0 }; } else { t[pos] = { 0,1 }; t_rev[pos] = { 0,1 }; } return; } int mid = (l + r) / 2; bld(l, mid, 2 * pos); bld(mid + 1, r, 2 * pos + 1); t[pos] = merge(t[2 * pos], t[2 * pos + 1]); t_rev[pos] = merge(t_rev[2 * pos + 1], t_rev[2 * pos]); } pii qry(int l, int r, int type, int tl = 0, int tr = n - 1, int pos = 1) { if (l == tl && r == tr) { return type == 1 ? t[pos] : t_rev[pos]; } int mid = (tl + tr) / 2; if (mid >= r) { return qry(l, r, type, tl, mid, 2 * pos); } if (mid < l) { return qry(l, r, type, mid + 1, tr, 2 * pos + 1); } if (type == 1) { return merge(qry(l, mid, type, tl, mid, 2 * pos), qry(mid + 1, r, type, mid + 1, tr, 2 * pos + 1)); } else { return merge(qry(mid + 1, r, type, mid + 1, tr, 2 * pos + 1), qry(l, mid, type, tl, mid, 2 * pos)); } } void slv() { cin >> n >> s >> q; bld(); while (q--) { int l, r; cin >> l >> r; cout << max(qry(l - 1, r - 1, 1).ss, qry(l - 1, r - 1, 2).ss) << '\n'; } } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }

Compilation message (stderr)

election.cpp: In function 'll range_sum(ll, ll)':
election.cpp:92:21: warning: unused variable 'cnt' [-Wunused-variable]
   92 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
election.cpp: In function 'll bin_to_dec(std::string)':
election.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...