oj.uz

Submission #866414

# Submission time Handle Problem Language Result Execution time Memory
866414 2023-10-26T05:51:55 Z vjudge1 Grudanje (COCI19_grudanje) C++17
70 / 70
 539 ms 26432 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define pb push_back
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define ordered_set tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update>
const int N = 3e5+1;
const int MOD = 1e9+7;

void solve() {
	string s;
	cin >> s;
	int n = s.size();
	int q;
	cin >> q;
	vector<pii> ranges(q+1);
	F(i,q) cin >> ranges[i].first >> ranges[i].second;
	vi p(n+1);
	F(i,n) cin >> p[i];
	int l = 0;
	int r = n;
	while (l<=r) {
		int m = (l+r) >> 1;
		vector<bool> fucked(n+1);
		F(i,m) fucked[p[i]] = 1;
		vector<vi> pref(26,vi(n+1,0));
		F(i,n) {
			for (int j=0;j<26;j++) pref[j][i] = pref[j][i-1];
			if (!fucked[i])pref[s[i-1]-'a'][i]++;
		}
		bool fl = 1;
		for (auto it : ranges) {
			for (int i=0;i<26;i++) {
				if (pref[i][it.second]-pref[i][it.first-1] >= 2) {
					fl = 0;
				}
			}
		}
		if (fl) r = m-1;
		else l = m+1;
	}
	cout << l << endl;
}       
    
                 
                             
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t; 
	F(i,t) solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1200 KB Output is correct
2 Correct 5 ms 1204 KB Output is correct
3 Correct 4 ms 1200 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1200 KB Output is correct
2 Correct 5 ms 1200 KB Output is correct
3 Correct 4 ms 1196 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1200 KB Output is correct
2 Correct 5 ms 1200 KB Output is correct
3 Correct 4 ms 1200 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 26040 KB Output is correct
2 Correct 306 ms 25964 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 26024 KB Output is correct
2 Correct 308 ms 25940 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 26256 KB Output is correct
2 Correct 408 ms 26044 KB Output is correct
3 Correct 330 ms 26380 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 26040 KB Output is correct
2 Correct 443 ms 26432 KB Output is correct
3 Correct 338 ms 26036 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 26320 KB Output is correct
2 Correct 533 ms 26268 KB Output is correct
3 Correct 318 ms 25920 KB Output is correct