oj.uz

답안 #673505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673505 2022-12-20T18:15:52 Z ghostwriter 가로등 (APIO19_street_lamps) C++17
60 / 100
 731 ms 47824 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
struct Query {
	str type;
	int i, a, b;
	Query() {}
};
const int N = 3e5 + 5;
int n, q;
char s[N];
Query query[N];
void input(int test_id) {
	cin >> n >> q;
	FOR(i, 1, n) cin >> s[i];
	FOR(i, 1, q) {
		cin >> query[i].type;
		if (query[i].type == "toggle") cin >> query[i].i;
		else {
			cin >> query[i].a >> query[i].b;
			--query[i].b;
		}
	}
}
namespace subtask1 {
	vector<str> versions;
	bool check_valid() {
		if (n <= 100 && q <= 100) return 1;
		return 0;
	}
	bool check(str &s, int l, int r) {
		str tmp = s.substr(l - 1, r - l + 1);
		EACH(i, tmp)
			if (i != '1')
				return 0;
		return 1;
	}
	void solve() {
		str s1(n, '0');
		FOR(i, 1, n) s1[i - 1] = s[i];
		versions.pb(s1);
		FOR(j, 1, q) {
			str tmp = versions.bk();
			if (query[j].type == "toggle") {
				int i = query[j].i;
				tmp[i - 1] = 1 - tmp[i - 1] + 2 * '0';
			}
			if (query[j].type == "query") {
				int a = query[j].a, b = query[j].b, rs = 0;
				EACH(hour, versions)
					if (check(hour, a, b))
						++rs;
				cout << rs << '\n';
			}
			versions.pb(tmp);
		}
	}
}
namespace subtask2 {
	int f[N], d[N];
	bool check_valid() {
		FOR(i, 1, q)
			if (query[i].type == "query" && query[i].b - query[i].a != 0)
				return 0;
		return 1;
	}
	void solve() {
		FOR(j, 1, q)
			if (query[j].type == "toggle") {
				int i = query[j].i;
				s[i] = 1 - s[i] + 2 * '0';
				if (s[i] == '0') f[i] += j - d[i];
				d[i] = j;
			}
			else {
				int a = query[j].a, rs = f[a];
				if (s[a] == '1') rs += j - d[a];
				cout << rs << '\n';
			}
	}
}
namespace subtask3 {
	int l[N], r[N], ans[N], f[N];
	vi d[N];
	void upd(int pos, int v) { for (int i = pos; i <= n; i += (i & -i)) f[i] += v; }
	int get(int pos) { int rs = 0; for (int i = pos; i > 0; i -= (i & -i)) rs += f[i]; return rs; }
	bool check_valid() {
		bool ok = 1;
		FOR(j, 1, q) {
			if (query[j].type != "toggle") continue;
			int i = query[j].i;
			if (s[i] == '1') ok = 0;
			s[i] ^= 1;
		}
		FOR(j, 1, q) {
			if (query[j].type != "toggle") continue;
			int i = query[j].i;
			s[i] ^= 1;
		}
		return ok;
	}
	void solve() {
		FOR(j, 1, q)
			if (query[j].type == "query") {
				l[j] = 1;
				r[j] = j;
				ans[j] = j + 1;
			}
			else l[j] = r[j] + 1;
		FRN(iterated, 19) {
			memset(f, 0, sizeof f);
			FOR(i, 1, n) upd(i, s[i] - '0');
			FOR(i, 1, q)
				if (l[i] <= r[i]) {
					int mid = l[i] + (r[i] - l[i]) / 2;
					d[mid].pb(i);
				}
			FOR(j, 1, q) {
				EACH(i, d[j]) {
					int a = query[i].a, b = query[i].b;
					if (get(b) - get(a - 1) == b - a + 1) {
						ans[i] = j;
						r[i] = j - 1;
					}
					else l[i] = j + 1;
				}
				d[j].clear();
				if (query[j].type == "toggle") {
					int i = query[j].i, prev = s[i] - '0', newv = !prev;
					upd(i, newv - prev);
					s[i] ^= 1;
				}
			}
			FOR(j, 1, q)
				if (query[j].type == "toggle")
					s[query[j].i] ^= 1;
		}
		FOR(j, 1, q)
			if (query[j].type == "query")
				cout << j - ans[j] + 1 << '\n';
	}
}
void solve(int test_id) {
	if (subtask1::check_valid()) {
		subtask1::solve();
		return;
	}
	if (subtask2::check_valid()) {
		subtask2::solve();
		return;
	}
	if (subtask3::check_valid()) {
		subtask3::solve();
		return;
	}
}
void reinit(int test_id) {
 
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
5 5
11111
query 1 5
toggle 1
query 2 5
toggle 1
query 1 5
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 12 ms 21380 KB Output is correct
3 Correct 10 ms 21460 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 10 ms 21428 KB Output is correct
6 Correct 10 ms 21372 KB Output is correct
7 Correct 11 ms 21460 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 22348 KB Output is correct
2 Correct 85 ms 22348 KB Output is correct
3 Correct 84 ms 22364 KB Output is correct
4 Correct 98 ms 24704 KB Output is correct
5 Correct 97 ms 23920 KB Output is correct
6 Correct 88 ms 24688 KB Output is correct
7 Correct 99 ms 22268 KB Output is correct
8 Correct 106 ms 23660 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 22612 KB Output is correct
2 Correct 13 ms 22704 KB Output is correct
3 Correct 15 ms 22604 KB Output is correct
4 Correct 12 ms 22636 KB Output is correct
5 Correct 480 ms 32188 KB Output is correct
6 Correct 715 ms 40772 KB Output is correct
7 Correct 731 ms 41484 KB Output is correct
8 Correct 567 ms 47812 KB Output is correct
9 Correct 415 ms 38852 KB Output is correct
10 Correct 440 ms 40088 KB Output is correct
11 Correct 442 ms 40844 KB Output is correct
12 Correct 630 ms 42480 KB Output is correct
13 Correct 576 ms 47824 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 21460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 12 ms 21380 KB Output is correct
3 Correct 10 ms 21460 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 10 ms 21428 KB Output is correct
6 Correct 10 ms 21372 KB Output is correct
7 Correct 11 ms 21460 KB Output is correct
8 Correct 81 ms 22348 KB Output is correct
9 Correct 85 ms 22348 KB Output is correct
10 Correct 84 ms 22364 KB Output is correct
11 Correct 98 ms 24704 KB Output is correct
12 Correct 97 ms 23920 KB Output is correct
13 Correct 88 ms 24688 KB Output is correct
14 Correct 99 ms 22268 KB Output is correct
15 Correct 106 ms 23660 KB Output is correct
16 Correct 14 ms 22612 KB Output is correct
17 Correct 13 ms 22704 KB Output is correct
18 Correct 15 ms 22604 KB Output is correct
19 Correct 12 ms 22636 KB Output is correct
20 Correct 480 ms 32188 KB Output is correct
21 Correct 715 ms 40772 KB Output is correct
22 Correct 731 ms 41484 KB Output is correct
23 Correct 567 ms 47812 KB Output is correct
24 Correct 415 ms 38852 KB Output is correct
25 Correct 440 ms 40088 KB Output is correct
26 Correct 442 ms 40844 KB Output is correct
27 Correct 630 ms 42480 KB Output is correct
28 Correct 576 ms 47824 KB Output is correct
29 Incorrect 10 ms 21460 KB Output isn't correct
30 Halted 0 ms 0 KB -