Submission #1009832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009832		kebine	Martian DNA (BOI18_dna)	C++17	100 / 100	677 ms	36996 KiB

dna

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define inf LLONG_MAX
#define pb push_back
#define lc 2*pos+1
#define rc 2*pos+2
#define halleluya  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
signed main(){
halleluya
    int n,k,re;cin>>n>>k>>re;
    int num[n];
    map<int,int>req;
    map<int,int>freq;
    int tot=re;
    map<int,int>ad;
    for (int i=0;i<n;i++)cin>>num[i];    
    while (re--){
        int x,y;cin>>x>>y;
        ad[x]=1;
        req[x]=y;
    }

    // for (int i=0;i<n;i++){
    //     for (auto x:jum) {
    //         if (0<i) freq[{i,x}]=freq[{i-1,x}];
    //         if (x==num[i]) freq[{i,x}]++;
    //     }
    // }
    int l=0,r=-1;
    map<int,bool>vis;
    int ben=0;
    int ans=inf;
    while(l<n){
        while (ben<tot && r+1<n){
            r++;
            freq[num[r]]++;
            // cout<<r<<" "<<num[r]<<" "<<freq[num[r]]<<" "<<req[num[r]] <<endl;
            if (ad[num[r]]){
                if (freq[num[r]]>=req[num[r]] && vis[num[r]]==0 ){
                    vis[num[r]]=1;
                    // cout<<"namben "<<num[r]<<" di "<<r<<endl;
                    ben++;
                } 
            }
        }
        // cout<<l<<" "<<r<<endl;
        if (ben>=tot) ans=min(ans,r-l+1);
        freq[num[l]]--;
        if (ad[num[l]]){
            if (freq[num[l]]<req[num[l]] && vis[num[l]]){
                vis[num[l]]=0;
                ben--;
            }
            // cout<<ben<<endl;
        }
        l++;
    }
        
    if (ans==inf)cout<<"impossible";
    else cout<<ans;
}

// impossible -> jumlah kurang atau emang gaada substringnya 
// harus consecutive
// constraint r 
// cuman perlu shortest
// sliding window?
// cuma save jumlah k 
// n*k

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 28 / 28
• Subtask 4: 32 / 32