oj.uz

답안 #824011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824011 2023-08-13T11:24:45 Z Mohammed_Atalah 가로등 (APIO19_street_lamps) C++17
20 / 100
 5000 ms 34020 KB 
/// Template path: /home/mohammed/.config/sublime-text-3/Packages/User

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vecint;
typedef vector<char> vecchar;
typedef vector<string> vecstr;
typedef vector<long long> vecll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

// Marcos
#define endl ("\n")
#define int long long
#define mod 1000000007
#define pi (3.141592653589)
#define REP(i,a,b) for (int i = a; i < b; i++)
#define RREP(i,a,b) for (int i = a; i > b; i--)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

// Functions
long long squared(long long x) {return (x * x) % mod;}
int factorial(int n) {long long res = 1; for (int i = 1; i <= n; i++) {res = ((res * i) % mod + mod) % mod ;} return res;}
long long power(long long x, long long p) {if (p == 0) {return 1;} if (p % 2 == 1) {return (power(x, p - 1) * x) % mod;} return squared(power(x, p / 2));}

// cout << fixed;
// cout << setprecision(4);


// ---------(^_^)--------- //




void main_solve() {


	int n, q; cin >> n >> q;
	string s; cin >> s;
	map<int, map<int, int>> mp;

	int e = 0;
	while (q--) {
		e++;
		string type; cin >> type;
		if (type == "toggle") {
			for (int i  = 0; i < n ; i ++) {
				if (s[i] == '0') continue;
				for (int j = i; j < n ; j ++) {
					if (s[j] == '0')break;
					mp[i][j + 1]++;
				}
			}
			int x; cin >> x;
			if (s[x - 1] == '0') {
				s[x - 1] = '1';
			} else {
				s[x - 1] = '0';
			}
			continue;
		}

		for (int i  = 0; i < n ; i ++) {
			if (s[i] == '0') continue;
			for (int j = i; j < n ; j ++) {
				if (s[j] == '0')break;
				mp[i][j + 1]++;
			}
		}

		if (type == "query") {
			int a, b; cin >> a >> b;
			cout << mp[a - 1][b - 1] << endl;
		}





	}



}


int32_t main() {

	fast;
// #ifndef ONLINE_JUDGE
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt", "w", stdout);
// #endif
	// Just another problem (-_-)

	int t;
	t = 1;
	// cin >> t;

	while (t--) {
		main_solve();
	}


}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 21 ms 596 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 553 ms 1384 KB Output is correct
2 Correct 1821 ms 1512 KB Output is correct
3 Execution timed out 5087 ms 1756 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 21248 KB Output is correct
2 Correct 371 ms 31720 KB Output is correct
3 Correct 700 ms 31640 KB Output is correct
4 Execution timed out 5076 ms 31644 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 468 KB Output is correct
2 Correct 28 ms 512 KB Output is correct
3 Correct 27 ms 480 KB Output is correct
4 Correct 34 ms 468 KB Output is correct
5 Execution timed out 5088 ms 34020 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 21 ms 596 KB Output is correct
8 Correct 553 ms 1384 KB Output is correct
9 Correct 1821 ms 1512 KB Output is correct
10 Execution timed out 5087 ms 1756 KB Time limit exceeded
11 Halted 0 ms 0 KB -