Submission #555626

#	Time	Username	Problem	Language	Result	Execution time	Memory
555626		Khizri	Nekameleoni (COCI15_nekameleoni)	C++17	42 / 140	3089 ms	1160 KiB

nekameleoni

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,m,arr[mxn];
void solve(){
    scanf("%d %d %d",&n,&k,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&arr[i]);
    }
    while(m--){
        int x;
        scanf("%d",&x);
        if(x==1){
            int a,b;
            scanf("%d %d",&a,&b);
            arr[a]=b;
        }
        else{
            vector<int>cnt(k+5);
            int say=0;
            int l=1;
            int ans=1e6;
            for(int i=1;i<=n;i++){
                cnt[arr[i]]++;
                if(cnt[arr[i]]==1){
                    say++;
                }
                while(l<i&&cnt[arr[l]]>1){
                    cnt[arr[l]]--;
                    l++;
                }
                if(say==k){
                    ans=min(ans,i-l+1);
                }
            }
            if(ans==1e6){
                printf("-1\n");
            }
            else{
                printf("%d\n",ans);
            }
        }
    }
}
int main(){
    //IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message (stderr)

nekameleoni.cpp: In function 'void solve()':
nekameleoni.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%d %d %d",&n,&k,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
nekameleoni.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d",&arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~
nekameleoni.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%d",&x);
      |         ~~~~~^~~~~~~~~
nekameleoni.cpp:58:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |             scanf("%d %d",&a,&b);
      |             ~~~~~^~~~~~~~~~~~~~~

• 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