Submission #555548

#	Time	Username	Problem	Language	Result	Execution time	Memory
555548		fuad27	Nekameleoni (COCI15_nekameleoni)	C++17	14 / 140	3097 ms	21168 KiB

nekameleoni

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 50010;
const int MAXK = 50;
int k;
vector<int> pref[50];
bool check(int l, int r) {
	bool c = true;
	for(int i = 0;i<k;i++) {
		if(!(pref[i][r+1] - pref[i][l]))c = false;
	}	
	return c;
}
int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> k >> m;
	for(int i = 0;i<50;i++) {
		pref[i].resize(MAXN);
	}
	int arr[n];
	for(int i = 0;i<n;i++){
		cin >> arr[i];
		arr[i]--;
	}
	for(int i = 0;i<50;i++) {
		pref[i][0] = 0;
		for(int j = 1;j<=n;j++) {
			if(arr[j-1] == i) {
				pref[i][j] = pref[i][j-1]+1;
			}
			else pref[i][j] = pref[i][j-1];
		}
	}
	while(m--) {
		int type;
		cin >> type;
		if(type == 1) {
			int p, v;
			cin >> p >> v;
			v--;p--;
			arr[p] = v;
			for(int i = 0;i<50;i++) {
				pref[i][0] = 0;
				for(int j = 1;j<=n;j++) {
					if(arr[j-1] == i) {
						pref[i][j] = pref[i][j-1]+1;
					}
					else pref[i][j] = pref[i][j-1];
				}
			}
		}
		else {
	 			int p1 = 0, p2 = 0;
    			int ans = 1e9;
    			while(p2 < n) {
    				if(check(p1, p2)) {
    					ans = min(ans, (int)p2-p1+1);
    					p1++;
    				}
    				else {
    					p2++;
    				}
    			}
    			if(ans == 1e9)ans = -1;
    			cout << ans << "\n";
		}
	}
}

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