제출 #555558

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555558		fuad27	Nekameleoni (COCI15_nekameleoni)	C++17	28 / 140	3071 ms	692 KiB

nekameleoni

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
const int MAXN = 5010;
const int MAXK = 50;
int k;
int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> k >> m;
	int arr[n];
	for(int i = 0;i<n;i++){
		cin >> arr[i];
		arr[i]--;
	}
	while(m--) {
		int type;
		cin >> type;
		if(type == 1) {
			int p, v;
			cin >> p >> v;
			v--;p--;
			arr[p] = v;
		}
		else {
				map<int,int> mp;
	 			int p1 = 0, p2 = 0;
				int mx = 0;
				int ans = 1e9;
				set<int> s;
				mp[arr[0]]++;
				for(int i = 0;i<50;i++)s.insert(i);
				s.erase(arr[0]);
    			while(p2 < n) {
					mx = *(s.begin());
    				if(mx >= k) {
    					ans = min(ans, (int)p2-p1+1);
						mp[arr[p1]]--;
						if(mp[arr[p1]] == 0)s.insert(arr[p1]);
    					p1++;
    				}
    				else {
						if(p2 < n-1){
							mp[arr[p2+1]]++;
							s.erase(arr[p2+1]);
						}
    					p2++;
    				}
    			}
    			if(ans == 1e9)ans = -1;
    			cout << ans << "\n";
		}
	}
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 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