제출 #645205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
645205		mychecksedad	Martian DNA (BOI18_dna)	C++17	100 / 100	116 ms	8812 KiB

dna

/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;



int n, k, ss, a[N], dp[N], arr[N];
multiset<int> s;
vector<bool> is(N);
void solve(){
    cin >> n >> k >> ss;
    for(int i = 1; i <= n; ++i) cin >> a[i];

    for(int i = 0; i <= n; ++i) dp[i] = 0;

    for(int i = 1; i <= ss; ++i){
        int x, c; cin >> x >> c;
        dp[x] -= c;
        s.insert(-c);
        is[x] = 1;
    }
    int best = MOD, l = 1;
    for(int i = 1; i <= n; ++i){
        if(!is[a[i]]) continue;
        s.erase(s.find(dp[a[i]]));
        dp[a[i]]++;
        s.insert(dp[a[i]]);
        while(!is[a[l]] || dp[a[l]] > 0){
            if(!is[a[l]]){
                l++;
                continue;
            }
            s.erase(s.find(dp[a[l]]));
            dp[a[l]]--;
            s.insert(dp[a[l]]);
            l++;
        }

        if((*s.begin()) >= 0) best = min(best, i - l + 1);
    }
    if(best == MOD) cout << "impossible";
    else cout << best; 
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'int main()':
dna.cpp:61:16: warning: unused variable 'aa' [-Wunused-variable]
   61 |     int T = 1, aa;
      |                ^~

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