Submission #828258

#	Time	Username	Problem	Language	Result	Execution time	Memory
828258		TahirAliyev	Nekameleoni (COCI15_nekameleoni)	C++17	42 / 140	3076 ms	1040 KiB

nekameleoni

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pii pair<int, ll>

const int MAX = 100005;

int n, m, k; 

int arr[MAX];
int cnt[51];

bool check(int mid){
    memset(cnt, 0, sizeof(cnt));
    int zeros = k;
    for (int i = 1; i <= mid; i++)
    {
        cnt[arr[i]]++;
        if(cnt[arr[i]] == 1){
            zeros --;
        }
    }
    if(zeros == 0) return true;
    for (int i = mid + 1; i <= n; i++)
    {
        cnt[arr[i]]++;
        if(cnt[arr[i]] == 1){
            zeros --;
        }
        cnt[arr[i - mid]]--;
        if(cnt[arr[i - mid]] == 0){
            zeros ++;
        }
        if(zeros == 0){
            return true;
        }
    }
    return false;
}

int search(){
    int l = k, r = n;
    int ans = -1;
    while(l <= r){
        int mid = (l + r) / 2;
        if(check(mid)){
            r = mid - 1;
            ans = mid;
        }
        else{
            l = mid + 1;
        }
    }
    return ans;
}

int main(){
    cin >> n >> k >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
    }
    while(m--){
        int t; cin >> t;
        if(t == 1){
            int i, a;
            cin >> i >> a;
            arr[i] = a;
        }
        else{
            cout << search() << '\n';
        }
    }
}

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