제출 #647762

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647762		baojiaopisu	가로등 (APIO19_street_lamps)	C++14	100 / 100	1164 ms	343076 KiB

street_lamps

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 3e5 + 10;
const int LOG = 18;

struct SegmentTree {
	struct TrieNode {
		TrieNode* child[2];
		int sum;

		TrieNode() {
			child[0] = child[1] = nullptr;
			sum = 0;
		}
	};
	int n;
	vector<TrieNode*> node;

	SegmentTree(int _n = 0) {
		n = _n;
		node.resize(4 * n + 7);
		for(int i = 1; i <= 4 * n; i++) node[i] = new TrieNode();
	}
private:
	void addTrie(TrieNode* curr, int x, int val) {
		for(int i = LOG; i >= 0; i--) {
			int p = (x >> i & 1);
			if(curr->child[p] == nullptr) curr->child[p] = new TrieNode();
			curr = curr->child[p];
			curr->sum += val;
		}
	}

	void update(int L, int R, int lo, int hi, int u, int v, int val, int id) {
		if(L > hi || R < lo) return;
		if(lo <= L && R <= hi) {
			addTrie(node[id], u, val);
			addTrie(node[id], v + 1, -val);
			return;
		}

		int mid = (L + R) >> 1;
		update(L, mid, lo, hi, u, v, val, id << 1);
		update(mid + 1, R, lo, hi, u, v, val, id << 1 | 1);
	}

	int getTrie(TrieNode* curr, int x) {
		int ans = 0;
		for(int i = LOG; i >= 0; i--) {
			int p = (x >> i & 1);
			if(p == 1 && curr->child[0] != nullptr) ans += curr->child[0]->sum;
			if(curr->child[p] == nullptr) return ans;
			curr = curr->child[p];
		}
		return ans;
	}

	int get(int L, int R, int lo, int hi, int id) {
		int ans = getTrie(node[id], lo + 1);
		if(L == R) return ans;

		int mid = (L + R) >> 1;
		if(hi <= mid) return ans + get(L, mid, lo, hi, id << 1);
		else return ans + get(mid + 1, R, lo, hi, id << 1 | 1);
	}
public:
	void Update(int lo, int hi, int u, int v, int val) {
		update(1, n, lo, hi, u, v, val, 1);
	}

	int Get(int L, int R) {
		return get(1, n, L, R, 1);
	}
};

template <class T> struct FenwickTree {
	int n;
	vector<T> bit;

	FenwickTree(int _n = 0) {
		n = _n;
		bit.resize(n + 5);
		for(int i = 1; i <= n; i++) bit[i] = 0;
	}

	void update(int pos, T x) {
		for(int i = pos; i <= n; i += i & (-i)) bit[i] += x;
	}

	T get(int pos) {
		T ans = 0;
		for(int i = pos; i > 0; i -= i & (-i)) ans += bit[i];
		return ans;
	}
};

int state[N];

void solve() {
	int n, q; cin >> n >> q;
	set<int> zero;
	FenwickTree<int> BIT = FenwickTree<int>(n);
	for(int i = 1; i <= n; i++) {
		char c; cin >> c;
		state[i] = c - '0';
		if(!state[i]) zero.ins(i);
		BIT.update(i, state[i]);
	}

	SegmentTree IT = SegmentTree(n);

	for(int i = 1; i <= n; i++) {
		if(state[i] && !state[i - 1]) {
			int j = i;
			while(state[j + 1]) j++;
			IT.Update(i, j, i, j, -1);
			i = j;
		}
	}

	for(int i = 1; i <= q; i++) {
		string s; cin >> s;
		if(s == "toggle") {
			int id; cin >> id;
			if(state[id]) {
				int L, R;
				if(!zero.size()) {
					L = 1, R = n;
				} else {
					auto iter = zero.upper_bound(id);
					if(iter == zero.end()) R = n; else R = (*iter) - 1;
					if(iter == zero.begin()) L = 1;
					else iter--, L = (*iter) + 1;
				}

				IT.Update(id, R, L, id, i + 1);
				state[id] = 0;
				BIT.update(id, -1);
				zero.ins(id);
			} else {
				int L, R;
				zero.erase(id);
				if(!zero.size()) {
					L = 1, R = n;
				} else {
					auto iter = zero.upper_bound(id);
					if(iter == zero.end()) R = n; else R = (*iter) - 1;
					if(iter == zero.begin()) L = 1;
					else iter--, L = (*iter) + 1;
				}

				IT.Update(id, R, L, id, -i - 1);
				state[id] = 1;
				BIT.update(id, 1);
			}
		} else {
			int L, R; cin >> L >> R; R--;
			int ans = IT.Get(L, R);
			if(BIT.get(R) - BIT.get(L - 1) == R - L + 1) ans += i + 1;
			cout << ans << '\n';
		}		
	}
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}

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

street_lamps.cpp: In function 'int main()':
street_lamps.cpp:233:17: warning: unused variable 'ddd' [-Wunused-variable]
  233 |     int tc = 1, ddd = 0;
      |                 ^~~

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 20 / 20