Submission #1172021

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172021		baqqon_	Martian DNA (BOI18_dna)	C++20	0 / 100	2096 ms	4104 KiB

dna

/**

  III     U   U  N   N  DDDD   EEEEE  RRRR   SSSS  TTTTT  AAAAA  N   N  DDDD      I  TTTTT     N   N   OOO   W   W
   I      U   U  NN  N  D   D  E      R   R  S       T    A   A  NN  N  D   D     I    T       NN  N  O   O  W   W
   I      U   U  N N N  D   D  EEEE   RRRR   SSSS    T    AAAAA  N N N  D   D     I    T       N N N  O   O  W W W
   I      U   U  N  NN  D   D  E      R  R      S    T    A   A  N  NN  D   D     I    T       N  NN  O   O  WW WW
  III     UUUUU  N   N  DDDD   EEEEE  R   R  SSSS    T    A   A  N   N  DDDD      I    T       N   N   OOO   W   W

**/

#include <bits/stdc++.h>
using namespace std;

#define ent '\n'
#define F first
#define S second
#define in insert                                                            
#define no "NO\n"                                                            
#define yes "YES\n"                                                         
#define pb push_back                                                        
#define sz(w) w.size()                                                           
#define int long long                                                       
#define all(w) w.begin(), w.end()                                           
#define BakTR ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

const int MOD = 998244353, N = 1e5 + 7 , inf = 1e9 + 7, INF = 2e18, LOG = 20 , mod = 1e6 + 7 ;

void accepted() {
    int n , k , q ;
    cin >> n >> k >> q ;
    vector <pair <int , int>> v ;
    int a[n + 1] ;
    for(int  i= 1 ; i <= n ; i++) cin >> a[i] ;
    while(q--){
        int l , r ;
        cin >> l >> r ;
        v.pb({l , r}) ;
    }
    int mn = INF ;
    for(int l = 1 ; l < n ; l++) {
        for(int r = l + 1 ; r <= n ; r++) {
            bool ok = 1 ;
            map <int , int> cnt ;
            for(int i = l ; i <= r ; i++) {
                cnt[a[i]]++;
            }
            for(auto [l , r] : v) {
                if(cnt[l] < r) {
                    ok = 0 ;
                    break;
                }
            }
            if(ok) {
                mn = min(mn , r - l  + 1) ;
                break ;
            }
        }
    }
    if(mn == INF) {
        cout << "impossible" ;
        return ;
    }
    cout << mn ;
}
signed main() {
    BakTR

    //PLS NeverGiveUp

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    
    int T = 1; 
    //cin >> T;
    while (T--) {
        accepted();
        //cout << ent;
    }
}

/**
baktr
65868073990A98C52AFDB7A48F4E8D26
**/

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