제출 #1324637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324637		aaaaaaaa	Grudanje (COCI19_grudanje)	C++20	35 / 70	2095 ms	2044 KiB

grudanje

#include <bits/stdc++.h>
using namespace std;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(nullptr); cout.tie(nullptr);
	string str;
	int q, l, r, n, idx = 1, best = 0;
	vector<pair<int, int>> vec;
	cin >> str >> q;
	n = (int) str.size();
	vector<int> point(n + 1, 0);
	while(q--){
		cin >> l >> r;
		vec.push_back({l, r});
	}
	for(int i = 1; i <= n; ++i){
		cin >> point[i];
	}
	auto bad = [&](int l, int r) -> bool {
		set<char> st;
		for(int j = l - 1; j <= r - 1; ++j){
			if(str[j] != '*'){
				if(st.find(str[j]) != st.end()) return 1;
				st.insert(str[j]);
			}
		}
		return 0;
	};
	for(auto [l, r] : vec){
		while(idx <= n && bad(l, r)){
			str[point[idx] - 1] = '*';
			idx += 1, best += 1;
		}
	}
	cout << best << "\n";
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7