Submission #391236

#TimeUsernameProblemLanguageResultExecution timeMemory
391236Return_0Bubble Sort 2 (JOI18_bubblesort2)C++17
100 / 100
3403 ms128884 KiB
#pragma GCC optimize("Ofast,unroll-loops") // #pragma comment(linker, "/stack:200000000") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #ifndef SINA #include "bubblesort2.h" #endif using namespace std; using namespace __gnu_pbds; typedef int ll; typedef long double ld; typedef pair <ll, ll> pll; #ifdef SINA #define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); } #define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush(); #else #define dbg(...) 0 #define dbg2(x, j, n) 0 #endif #define SZ(x) ((ll)((x).size())) #define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout); #define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i]; #define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n'); #define kill(x) return cout<< (x) << endl, 0 #define cl const ll #define fr first #define sc second #define lc (v << 1) #define rc (lc | 1) #define mid ((l + r) >> 1) #define All(x) (x).begin(), (x).end() cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353; template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';} template <class A> ostream& operator << (ostream& out, const vector<A> &a) { out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; } template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>; cl N = 5e5 + 7; struct segtree { ll l, r, mx, lz; segtree *lt, *rt; inline segtree (cl &L = 1, cl &R = N - 2) : l(L), r(R), mx(0), lz(0) {} void build () { mx = -inf; if (l == r) return; lt = new segtree (l, mid); rt = new segtree (mid + 1, r); lt->build(); rt->build(); } inline void push (cl &x) { mx += x; lz += x; } inline void shift () { lt->push(lz); rt->push(lz); lz = 0; } void upd (cl &ql, cl &qr, cl &x) { if (r < ql || qr < l) return; if (ql <= l && r <= qr) { push(x); return; } shift(); lt->upd(ql, qr, x); rt->upd(ql, qr, x); mx = max(lt->mx, rt->mx); } ll ask (cl &ql, cl &qr) { if (r < ql || qr < l) return -inf; if (ql <= l && r <= qr) return mx; shift(); return max(lt->ask(ql, qr), rt->ask(ql, qr)); } } seg; vector <ll> countScans (vector <ll> a, vector <ll> x, vector <ll> v) { ll n = SZ(a), q = SZ(x); vector <pll> cmprs; for (ll i = 0; i < n; i++) cmprs.push_back({a[i], i}); for (ll i = 0; i < q; i++) cmprs.push_back({v[i], x[i]}); sort(All(cmprs)); cmprs.resize(unique(All(cmprs)) - cmprs.begin()); seg.r = SZ(cmprs); seg.build(); const auto fun = [&](cl &val, cl &pos, cl &z) { ll P = lower_bound(All(cmprs), pll(val, pos)) - cmprs.begin() + 1; seg.upd(P, P, z * (inf + pos)); seg.upd(P + 1, seg.r, z * -1); }; for (ll i = 0; i < n; i++) fun(a[i], i, 1); vector <ll> ans (q); for (ll i = 0, p1, p2; i < q; i++) { fun(a[x[i]], x[i], -1); a[x[i]] = v[i]; fun(v[i], x[i], 1); ans[i] = seg.mx; } return ans; } #ifdef SINA int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout<< countScans({1, 2, 3, 4}, {0, 2}, {3, 1}) << endl; cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; return 0; } #endif /* */

Compilation message (stderr)

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:103:17: warning: unused variable 'p1' [-Wunused-variable]
  103 |  for (ll i = 0, p1, p2; i < q; i++) {
      |                 ^~
bubblesort2.cpp:103:21: warning: unused variable 'p2' [-Wunused-variable]
  103 |  for (ll i = 0, p1, p2; i < q; i++) {
      |                     ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...