제출 #211341

#제출 시각아이디문제언어결과실행 시간메모리
211341thecodingwizard가로등 (APIO19_street_lamps)C++11
60 / 100
5076 ms180340 KiB
//#pragma GCC optimize ("O3") //#pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define F0R(i, a) for (int i=0; i<(a); i++) #define F0R1(i, a) for (int i=1; i<=(a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto& a : x) #define MIN(a, b) a = min(a, b) #define MAX(a, b) a = max(a, b) #define INF 1000000010 #define LL_INF 4500000000000000000LL #define LSOne(S) (S & (-S)) #define EPS 1e-9 #define pA first #define pB second #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define PI acos(-1.0) #define MOD2 (int)(2e+9+11) #define MOD (int)(1e+9+7) #define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val; #define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val; #define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val; #define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val; #define lb lower_bound #define ub upper_bound #define sz(x) (int)x.size() #define beg(x) x.begin() #define en(x) x.end() #define all(x) beg(x), en(x) #define resz resize #define SORT(vec) sort(all(vec)) #define RSORT(vec) sort(vec.rbegin(),vec.rend()) typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef pair<int, int> ii; typedef pair<int, ii> iii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<ll> vl; // @formatter:off // Source: Benq (https://github.com/bqi343/USACO) [Modified] namespace input { template<class T> void re(complex<T>& x); template<class T1, class T2> void re(pair<T1,T2>& p); template<class T> void re(vector<T>& a); template<class T, size_t SZ> void re(array<T,SZ>& a); template<class T> void reA(T A[], int sz); template<class T> void re(T& x) { cin >> x; } void re(double& x) { string t; re(t); x = stod(t); } void re(ld& x) { string t; re(t); x = stold(t); } template<class Arg, class... Args> void re(Arg& first, Args&... rest) { re(first); re(rest...); } template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); } template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); } template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); } template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); } void setupIO(const string &PROB = "") { ios::sync_with_stdio(false); cin.tie(nullptr); if (PROB.length() != 0) { ifstream infile(PROB + ".in"); if (infile.good()) { freopen((PROB + ".in").c_str(), "r", stdin); freopen((PROB + ".out").c_str(), "w", stdout); } } } } using namespace input; namespace output { template<class T1, class T2> void prD(const pair<T1,T2>& x); template<class T, size_t SZ> void prD(const array<T,SZ>& x); template<class T> void prD(const vector<T>& x); template<class T> void prD(const set<T>& x); template<class T1, class T2> void prD(const map<T1,T2>& x); template<class T1, class T2> void pr(const pair<T1,T2>& x); template<class T, size_t SZ> void pr(const array<T,SZ>& x); template<class T> void pr(const vector<T>& x); template<class T> void pr(const set<T>& x); template<class T1, class T2> void pr(const map<T1,T2>& x); template<class T> void prD(const T& x) { cout << x; cout.flush(); } template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) { prD(first); prD(rest...); } template<class T1, class T2> void prD(const pair<T1,T2>& x) { prD("{",x.pA,", ",x.pB,"}"); } template<class T> void prDContain(const T& x) { prD("{"); bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool> prD("}"); } template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); } template<class T> void prD(const vector<T>& x) { prDContain(x); } template<class T> void prD(const set<T>& x) { prDContain(x); } template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); } void psD() { prD("\n"); } template<class Arg> void psD(const Arg& first) { prD(first); psD(); // no space at end of line } template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) { prD(first," "); psD(rest...); // print w/ spaces } template<class T> void pr(const T& x) { cout << x; } template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { pr(first); pr(rest...); } template<class T1, class T2> void pr(const pair<T1,T2>& x) { pr(x.pA, " ", x.pB); } template<class T> void prContain(const T& x) { bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool> } template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); } template<class T> void pr(const vector<T>& x) { prContain(x); } template<class T> void pr(const set<T>& x) { prContain(x); } template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); } void ps() { pr("\n"); } template<class Arg> void ps(const Arg& first) { pr(first); ps(); // no space at end of line } template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { pr(first," "); ps(rest...); // print w/ spaces } } using namespace output; // @formatter:on /* ============================ */ mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); struct item { int key, pr, cnt = 1, val = 0, sum = 0; item *l, *r; }; typedef item* pitem; int cnt (pitem t) { return t ? t->cnt : 0; } int sum(pitem t) { return t ? t->sum : 0; } void upd (pitem t) { if (t) { t->cnt = 1 + cnt(t->l) + cnt(t->r); t->sum = t->val + sum(t->l) + sum(t->r); } } void split (pitem t, int key, pitem & l, pitem & r) { if (!t) l = r = NULL; else if (key < t->key) split (t->l, key, l, t->l), r = t; else split (t->r, key, t->r, r), l = t; upd(t); } void insert (pitem & t, pitem it) { if (!t) t = it; else if (it->pr > t->pr) split (t, it->key, it->l, it->r), t = it; else insert (it->key < t->key ? t->l : t->r, it); upd(t); } bool updateExistingKey (pitem & t, int k, int v) { if (!t) { return false; } else if (t->key == k) { t->val += v; upd(t); return true; } else { bool res = updateExistingKey(k < t->key ? t->l : t->r, k, v); if (res) { upd(t); } return res; } } void update(pitem &root, int k, int v) { if (!updateExistingKey(root, k, v)) { pitem it = new item(); it->key = k; it->val = v; it->pr = rng(); insert(root, it); } } void merge (pitem & t, pitem l, pitem r) { if (!l || !r) t = l ? l : r; else if (l->pr > r->pr) merge (l->r, l->r, r), t = l; else merge (r->l, l, r->l), t = r; upd(t); } int query(pitem root, int L, int R) { pitem t1, t2, t3; split(root, L - 1, t1, t2); split(t2, R, t2, t3); int val = t2 ? t2->sum : 0; merge(root, t1, t2); merge(root, root, t3); return val; } pitem fenwickTree[300005]; int n, q; vector<bool> A; int query(int a, int b) { int val = 0; for (; a; a -= LSOne(a)) { val += query(fenwickTree[a], 0, b); } return val; } void upd(int k, int l, int r, int v) { for (; k <= n; k += LSOne(k)) { update(fenwickTree[k], l, v); update(fenwickTree[k], r+1, -v); } } void upd(int minL, int maxL, int minR, int maxR, int v) { upd(minL, minR, maxR, v); upd(maxL+1, minR, maxR, -v); } int ft[300001]; void upd(int k, int v) { for (; k <= n; k += LSOne(k)) ft[k] += v; } int qry(int k) { if (k == 0) return 0; int s = 0; for (; k; k -= LSOne(k)) s += ft[k]; return s; } int findLeft(int x) { int lo = 1, hi = x+1, mid, ans = x; while (lo < hi) { mid = (lo + hi)/2; int val = qry(x)-qry(mid - 1); if (val == x-mid + 1) { hi = mid; ans = mid; } else { lo = mid + 1; } } return ans; } int findRight(int x) { int lo = x, hi = n+1, mid, ans = x; while (lo < hi) { mid = (lo + hi)/2; int val = qry(mid) - qry(x - 1); if (val == mid-x+1) { lo = mid + 1; ans = mid; } else { hi = mid; } } return ans; } int main() { setupIO(); re(n, q); A.resz(n+1); SET(ft, 0, n+1); F0R1(i, n) { char c; re(c); A[i] = c == '1'; if (A[i]) upd(i, 1); } F0R1(i, q) { string s; re(s); if (s == "query") { int a, b; re(a, b); psD(query(a, b - 1) + (A[b-1] && findLeft(b - 1) <= a ? i : 0)); } else { int a; re(a); if (A[a]) { // switching off int l = findLeft(a), r = findRight(a); A[a] = false; upd(a, -1); upd(l, a, a, r, i); } else { // switching on A[a] = true; upd(a, 1); int l = findLeft(a), r = findRight(a); upd(l, a, a, r, -i); } } } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

street_lamps.cpp: In function 'void input::setupIO(const string&)':
street_lamps.cpp:85:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:86:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...