제출 #1150268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150268		arafatenok	Martian DNA (BOI18_dna)	C++17	40 / 100	202 ms	125968 KiB

dna

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;

const int mod = 1e9 + 7;
const int N = 4e3 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

int pref[N][N];

void solve() {
    int n, k, q;
    cin >> n >> k >> q;
    int a[n + 1];
    int fr[q + 1], sc[q + 1];
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        for(int j = 0; j <= k; j++){
            pref[j][i] = pref[j][i - 1];
        }
        pref[a[i]][i]++;
    }
    for(int i = 1; i <= q; i++){
        cin >> fr[i] >> sc[i];
    }
    int ok = 1;
    for(int i = 1; i <= q; i++){
        if(pref[fr[i]][n] - pref[fr[i]][0] < sc[i]) ok = 0;
    }
    if(!ok){
        cout << "impossible";
        return;
    }
    int mn = inf;
    for(int i = 1; i <= n; i++){
        int l = i, r = n;
        while(l <= r){
            int m = (l + r) / 2;
            ok = 1;
            for(int j = 1; j <= q; j++){
                if(pref[fr[j]][m] - pref[fr[j]][i - 1] < sc[j]) ok = 0;
            }
            if(ok){
                mn = min(mn, m - i + 1);
                r = m - 1;
            }
            else l = m + 1;
        }
    }
    cout << mn;
}

signed main() {
    gold;
    //freopen("rmq.in", "r", stdin);
    //freopen("rmq.out", "w", stdout);
    int t = 1;
    int ti = 1;
    //cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

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