oj.uz

답안 #541274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541274 2022-03-22T21:33:21 Z Lobo Martian DNA (BOI18_dna) C++17
0 / 100
 26 ms 4796 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2e5+10;

int n,k,R,s[maxn], mn[maxn], qtd[maxn];

void solve() {
    cin >> n >> k >> R;
    for(int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    int q = R;
    for(int i = 1; i <= R; i++) {
        int id;
        cin >> id;
        cin >> mn[id];
    }

    int ans = inf;
    int r = 0;
    for(int i = 1; i <= n; i++) {
        while(r != n && q != 0) {
            //aumenta r
            r++;
            qtd[s[r]]++;
            if(qtd[s[r]] == mn[s[r]]) {
                q--;
            }
        }

        if(q == 0) ans = min(ans, r-i+1);

        //tira i
        qtd[s[i]]--;
        if(qtd[s[i]] == mn[s[r]]-1) {
            q++;
        }
    }

    if(ans == inf) cout << "impossible" << endl;
    else cout << ans << endl;


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 4796 KB Output isn't correct
2 Halted 0 ms 0 KB -