제출 #1009800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009800		devariaota	Martian DNA (BOI18_dna)	C++17	68 / 100	2021 ms	15688 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;
    vector<int>jum;

    for (int i=0;i<n;i++)cin>>num[i];    
    while (re--){
        int x,y;cin>>x>>y;
        req[x]=y;
        jum.pb(x);
    }

    // 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;
    freq[num[0]]++;
    freq[num[1]]++;
    int ans=inf;
    while(l<=r){
        bool sal=1;
        for (auto x:jum){
            while (freq[x]<req[x] && r+1<n){
                r++;  
                freq[num[r]]++;
            }
            if (freq[x]<req[x] && r==n-1) sal=0;
            
        }
        if (sal) ans=min(ans,r-l+1);
        freq[num[l]]--;
        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: 0 / 32