oj.uz

답안 #1031956

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031956 2024-07-23T09:06:06 Z Halym2007 가로등 (APIO19_street_lamps) C++17
20 / 100
 5000 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define ll long long
#define pii pair <int, int> 
const int N = 1e4 + 5;
vector <string> v;

int main () {
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//	freopen ("input.txt", "r", stdin);
	int n, q;
	string s;
	cin >> n >> q >> s;
	while ( q-- ) {
		string s1;
		cin >> s1;
		if (s1 == "query") {
			int l, r;
			v.pb (s);
			cin >> l >> r;
			int jog = 0;
//			if  (q == 0) {
//				cout << l - 1 << " " << r - 2 << " " << s << "\n";
//				
//				for (string i : v) {
//					cout << "biz->" << i << "\n";
//				}
//				return 0;
//			}
			for (int i = 0; i < (int)v.sz; ++i) {
				int tr = 0;
				for (int j = l - 1; j < r - 1; ++j) {
					if (v[i][j] == '0') tr = 1;
//					if (!q) cout << v[i][j];
				}
				if (!tr) {
					jog++;
//					if (!q) cout << "gecdi->" << i << "\n"; 	
				}
//				if (!q)cout << "\n";
			}
//			if (!q)return 0;
			cout << jog << "\n";
		}
		else {
			int l;
			cin >> l;
			v.pb (s);
			if (s[l - 1] == '0') s[l - 1] = '1';
			else s[l - 1] = '0';
		}
	} 
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5065 ms 14264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Correct 35 ms 1488 KB Output is correct
3 Correct 68 ms 1236 KB Output is correct
4 Correct 115 ms 1468 KB Output is correct
5 Runtime error 1101 ms 524288 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 1384 KB Output is correct
2 Correct 100 ms 1360 KB Output is correct
3 Correct 64 ms 1368 KB Output is correct
4 Correct 13 ms 1368 KB Output is correct
5 Runtime error 219 ms 524288 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Execution timed out 5065 ms 14264 KB Time limit exceeded
9 Halted 0 ms 0 KB -