oj.uz

답안 #431083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431083 2021-06-17T09:22:38 Z Return_0 가로등 (APIO19_street_lamps) C++17
100 / 100
 4224 ms 280408 KB 
#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>

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 = 3e5 + 7;

ll n, q;
set <ll> off;
gp_hash_table <ll, ll> fen [N];
string s;

inline void add (ll l, cl &r, cl &x) { for (; l; l -= l & -l) for (ll i = r; i; i -= i & -i) fen[l][i] += x; }
inline void add_to_rect (cl &a, cl &b, cl &c, cl &d, cl &x) {
	add(b, d, x); add(a - 1, d, -x); add(b, c - 1, -x); add(a - 1, c - 1, x);
}
inline ll ask_sum (ll l, cl &r) {
	ll ret = 0;
	for (; l < N; l += l & -l) for (ll i = r; i < N; i += i & -i) if (fen[l].find(i) != fen[l].end()) ret += fen[l][i];
	return ret;
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> q >> s;
	off.insert(0); off.insert(n + 1);
	for (ll i = 0; i < n; i++) if (s[i] == '0') off.insert(i + 1);

	for (ll i = 1; i <= q; i++) {
		string tp; cin>> tp;
		if (tp == "toggle") {
			ll x; cin>> x;
			ll l = *(--off.lower_bound(x)) + 1, r = *off.upper_bound(x);
			if (off.count(x)) {
				off.erase(x);
				add_to_rect(l, x, x + 1, r, -i);
			} else {
				off.insert(x);
				add_to_rect(l, x, x + 1, r, i);
			}
		} else {
			ll l, r; cin>> l >> r;
			cout<< ask_sum(l, r) + (off.lower_bound(l) == off.upper_bound(r - 1) ? i : 0) << '\n';
		}
	}

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 7
11011
query 1 2
query 1 2
query 1 6
query 3 4
toggle 3
query 3 4
query 1 6

*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 63688 KB Output is correct
2 Correct 65 ms 63664 KB Output is correct
3 Correct 86 ms 63684 KB Output is correct
4 Correct 98 ms 63736 KB Output is correct
5 Correct 66 ms 63684 KB Output is correct
6 Correct 89 ms 63628 KB Output is correct
7 Correct 66 ms 63604 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 67908 KB Output is correct
2 Correct 645 ms 68292 KB Output is correct
3 Correct 2027 ms 72036 KB Output is correct
4 Correct 3971 ms 201804 KB Output is correct
5 Correct 3380 ms 206256 KB Output is correct
6 Correct 3582 ms 207308 KB Output is correct
7 Correct 1518 ms 84624 KB Output is correct
8 Correct 747 ms 71988 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 64068 KB Output is correct
2 Correct 77 ms 64004 KB Output is correct
3 Correct 70 ms 63928 KB Output is correct
4 Correct 64 ms 63684 KB Output is correct
5 Correct 4224 ms 280408 KB Output is correct
6 Correct 3896 ms 237852 KB Output is correct
7 Correct 3581 ms 205672 KB Output is correct
8 Correct 819 ms 72064 KB Output is correct
9 Correct 500 ms 67336 KB Output is correct
10 Correct 542 ms 67708 KB Output is correct
11 Correct 500 ms 67888 KB Output is correct
12 Correct 1536 ms 84772 KB Output is correct
13 Correct 720 ms 72052 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 63672 KB Output is correct
2 Correct 71 ms 63840 KB Output is correct
3 Correct 69 ms 63988 KB Output is correct
4 Correct 72 ms 64028 KB Output is correct
5 Correct 2346 ms 85328 KB Output is correct
6 Correct 3237 ms 184824 KB Output is correct
7 Correct 3417 ms 206876 KB Output is correct
8 Correct 3707 ms 224028 KB Output is correct
9 Correct 477 ms 67472 KB Output is correct
10 Correct 284 ms 66828 KB Output is correct
11 Correct 472 ms 67612 KB Output is correct
12 Correct 279 ms 66756 KB Output is correct
13 Correct 467 ms 67516 KB Output is correct
14 Correct 277 ms 66728 KB Output is correct
15 Correct 1479 ms 84652 KB Output is correct
16 Correct 715 ms 72072 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 63688 KB Output is correct
2 Correct 65 ms 63664 KB Output is correct
3 Correct 86 ms 63684 KB Output is correct
4 Correct 98 ms 63736 KB Output is correct
5 Correct 66 ms 63684 KB Output is correct
6 Correct 89 ms 63628 KB Output is correct
7 Correct 66 ms 63604 KB Output is correct
8 Correct 484 ms 67908 KB Output is correct
9 Correct 645 ms 68292 KB Output is correct
10 Correct 2027 ms 72036 KB Output is correct
11 Correct 3971 ms 201804 KB Output is correct
12 Correct 3380 ms 206256 KB Output is correct
13 Correct 3582 ms 207308 KB Output is correct
14 Correct 1518 ms 84624 KB Output is correct
15 Correct 747 ms 71988 KB Output is correct
16 Correct 71 ms 64068 KB Output is correct
17 Correct 77 ms 64004 KB Output is correct
18 Correct 70 ms 63928 KB Output is correct
19 Correct 64 ms 63684 KB Output is correct
20 Correct 4224 ms 280408 KB Output is correct
21 Correct 3896 ms 237852 KB Output is correct
22 Correct 3581 ms 205672 KB Output is correct
23 Correct 819 ms 72064 KB Output is correct
24 Correct 500 ms 67336 KB Output is correct
25 Correct 542 ms 67708 KB Output is correct
26 Correct 500 ms 67888 KB Output is correct
27 Correct 1536 ms 84772 KB Output is correct
28 Correct 720 ms 72052 KB Output is correct
29 Correct 69 ms 63672 KB Output is correct
30 Correct 71 ms 63840 KB Output is correct
31 Correct 69 ms 63988 KB Output is correct
32 Correct 72 ms 64028 KB Output is correct
33 Correct 2346 ms 85328 KB Output is correct
34 Correct 3237 ms 184824 KB Output is correct
35 Correct 3417 ms 206876 KB Output is correct
36 Correct 3707 ms 224028 KB Output is correct
37 Correct 477 ms 67472 KB Output is correct
38 Correct 284 ms 66828 KB Output is correct
39 Correct 472 ms 67612 KB Output is correct
40 Correct 279 ms 66756 KB Output is correct
41 Correct 467 ms 67516 KB Output is correct
42 Correct 277 ms 66728 KB Output is correct
43 Correct 1479 ms 84652 KB Output is correct
44 Correct 715 ms 72072 KB Output is correct
45 Correct 279 ms 66104 KB Output is correct
46 Correct 337 ms 66172 KB Output is correct
47 Correct 1663 ms 114652 KB Output is correct
48 Correct 3362 ms 201372 KB Output is correct
49 Correct 615 ms 67840 KB Output is correct
50 Correct 692 ms 67812 KB Output is correct
51 Correct 565 ms 67952 KB Output is correct
52 Correct 567 ms 68232 KB Output is correct
53 Correct 552 ms 68188 KB Output is correct
54 Correct 551 ms 68204 KB Output is correct