oj.uz

답안 #158048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
158048 2019-10-14T13:38:56 Z nvmdava 가로등 (APIO19_street_lamps) C++17
100 / 100
 1844 ms 311520 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
 
#define N 300005
#define INF 0x3f3f3f3f3f3f3f3f
 
struct Node{
	Node *l = NULL, *r = NULL;
	int val = 0;
 
	int query(int le, int ri, int x){
 
		if(le == ri) return val;
		int m = (le + ri) >> 1;
		if(m < x)
			return val + (r == NULL ? 0 : r -> query(m + 1, ri, x));
		return val + (l == NULL ? 0 : l -> query(le, m, x));
	}
 
	void update(int le, int ri, int R, int v){
		if(ri <= R){
			val += v;
			return;
		}
 
		int m = (le + ri) >> 1;
		
		if(l == NULL)
			l = new Node();
		l -> update(le, m, R, v);
 
		if(m < R){
			if(r == NULL)
				r = new Node();
			r -> update(m + 1, ri, R, v);
		}
	}
} *ans[N << 2];
 
int n, q;
 
void update(int id, int l, int r, int L, int R, int val){
	if(L <= l && r <= R){
		ans[id] -> update(1, n, R, val);
		return;
	}
	if(r < L || l > R){
		return;
	}
	int m = (l + r) >> 1;
	update(id << 1, l, m, L, R, val);
	update(id << 1 | 1, m + 1, r, L, R, val);
}
 
int query(int id, int l, int r, int x, int a){
	if(l == r){
		return ans[id] -> query(1, n, a);
	}
	int m = (l + r) >> 1;
 
	if(m < x)
		return ans[id] -> query(1, n, a) + query(id << 1 | 1, m + 1, r, x, a);
	return ans[id] -> query(1, n, a) + query(id << 1, l, m, x, a);
}
 
set<pair<pair<int, int>, int> > s;
int t;
 
void remove(set<pair<pair<int, int>, int> >::iterator it){
	update(1, 1, n, it -> ff.ss, it -> ff.ff, t - it -> ss);
	s.erase(it);
}
 
int st[N];
 
pair<int, int> tmp;
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	cin>>n>>q;
	tmp.ff = n + 1;
 
	for(int i = 1; i < (n << 2); ++i)
		ans[i] = new Node();
 
	for(int i = 1; i <= n; i++){
		char c;
		cin>>c;
		st[i] = c - '0';
		if(st[i] == 1){
			if(tmp.ff > n)
				tmp.ss = i;
			tmp.ff = i;
		} else {
			if(tmp.ff <= n){
				s.insert({tmp, 0});
				tmp.ff = n + 1;
			}
		}
	}
	
	if(tmp.ff <= n)
		s.insert({tmp, 0});
 
 
 
	for(t = 1; t <= q; t++){
		string q;
		int a, b;
		cin>>q;
		if(q[0] == 'q'){
			cin>>a>>b;
			b--;
			auto it = s.lower_bound({{a, 0}, 0});
			if(it == s.end())
				cout<<query(1, 1, n, a, b)<<'\n';
			else
				cout<<query(1, 1, n, a, b) + (it -> ff.ss <= a && it -> ff.ff >= b ? t - it -> ss : 0)<<'\n';
		} else {
			cin>>a;
			if(st[a] == 1){
				auto it = s.lower_bound({{a, 0}, 0});
				
				int le = it -> ff.ss;
				int ri = it -> ff.ff;
 
				remove(it);
 
				if(le < a)
					s.insert({{a - 1, le}, t});
				if(ri > a)
					s.insert({{ri, a + 1}, t});
			} else {
				int ri = a;
				int le = a;
				if(st[a + 1]){
					auto it = s.lower_bound({{a, a}, 0});
					ri = it -> ff.ff;
					remove(it);
				}
				if(st[a - 1]){
					auto it = s.lower_bound({{a - 1, 0}, 0});
					le = it -> ff.ss;
					remove(it);
				}
				s.insert({{ri, le}, t});
			}
			st[a] ^= 1;
		}
	}
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 177 ms 1376 KB Output is correct
2 Correct 225 ms 1696 KB Output is correct
3 Correct 437 ms 7876 KB Output is correct
4 Correct 1077 ms 180152 KB Output is correct
5 Correct 1545 ms 261264 KB Output is correct
6 Correct 1151 ms 196472 KB Output is correct
7 Correct 324 ms 49148 KB Output is correct
8 Correct 330 ms 50552 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1016 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 4 ms 888 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 1844 ms 311520 KB Output is correct
6 Correct 1644 ms 300844 KB Output is correct
7 Correct 1452 ms 260384 KB Output is correct
8 Correct 316 ms 50500 KB Output is correct
9 Correct 93 ms 1272 KB Output is correct
10 Correct 101 ms 1272 KB Output is correct
11 Correct 102 ms 1372 KB Output is correct
12 Correct 314 ms 49072 KB Output is correct
13 Correct 320 ms 50476 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 529 ms 57576 KB Output is correct
6 Correct 812 ms 140540 KB Output is correct
7 Correct 1074 ms 196064 KB Output is correct
8 Correct 1421 ms 249460 KB Output is correct
9 Correct 219 ms 1016 KB Output is correct
10 Correct 172 ms 508 KB Output is correct
11 Correct 213 ms 1040 KB Output is correct
12 Correct 175 ms 512 KB Output is correct
13 Correct 205 ms 1000 KB Output is correct
14 Correct 172 ms 504 KB Output is correct
15 Correct 316 ms 49148 KB Output is correct
16 Correct 322 ms 50568 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 177 ms 1376 KB Output is correct
9 Correct 225 ms 1696 KB Output is correct
10 Correct 437 ms 7876 KB Output is correct
11 Correct 1077 ms 180152 KB Output is correct
12 Correct 1545 ms 261264 KB Output is correct
13 Correct 1151 ms 196472 KB Output is correct
14 Correct 324 ms 49148 KB Output is correct
15 Correct 330 ms 50552 KB Output is correct
16 Correct 4 ms 1016 KB Output is correct
17 Correct 4 ms 888 KB Output is correct
18 Correct 4 ms 888 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 1844 ms 311520 KB Output is correct
21 Correct 1644 ms 300844 KB Output is correct
22 Correct 1452 ms 260384 KB Output is correct
23 Correct 316 ms 50500 KB Output is correct
24 Correct 93 ms 1272 KB Output is correct
25 Correct 101 ms 1272 KB Output is correct
26 Correct 102 ms 1372 KB Output is correct
27 Correct 314 ms 49072 KB Output is correct
28 Correct 320 ms 50476 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 632 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 4 ms 888 KB Output is correct
33 Correct 529 ms 57576 KB Output is correct
34 Correct 812 ms 140540 KB Output is correct
35 Correct 1074 ms 196064 KB Output is correct
36 Correct 1421 ms 249460 KB Output is correct
37 Correct 219 ms 1016 KB Output is correct
38 Correct 172 ms 508 KB Output is correct
39 Correct 213 ms 1040 KB Output is correct
40 Correct 175 ms 512 KB Output is correct
41 Correct 205 ms 1000 KB Output is correct
42 Correct 172 ms 504 KB Output is correct
43 Correct 316 ms 49148 KB Output is correct
44 Correct 322 ms 50568 KB Output is correct
45 Correct 79 ms 808 KB Output is correct
46 Correct 114 ms 732 KB Output is correct
47 Correct 512 ms 78332 KB Output is correct
48 Correct 993 ms 179484 KB Output is correct
49 Correct 108 ms 1272 KB Output is correct
50 Correct 111 ms 940 KB Output is correct
51 Correct 121 ms 1060 KB Output is correct
52 Correct 118 ms 1016 KB Output is correct
53 Correct 124 ms 1272 KB Output is correct
54 Correct 115 ms 1016 KB Output is correct