답안 #607396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
607396 2022-07-26T16:22:30 Z kawaii Martian DNA (BOI18_dna) C++14
100 / 100
115 ms 12096 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
 
int t, n, m, k, b, q, r, a[1000005], num[1000005], dem[1000005], mod = 1e9 + 7;
string s;
mt19937_64 rng;
bool flag[1000005];
int mul(int x, int y){
    if(y == 0) return 1;
    int ans = mul(x, y / 2);
    if(y % 2 == 0) return (ans * ans) % mod;
    else return (((ans * ans) % mod) * x) % mod;
}
 
void solve(){
    while(r--){
        cin >> b >> q;
        num[b] = q;
    }
    int l = 0; r = n + 1;
    while(r - l > 0){
        int mid = l + r >> 1, ans = 0, answer = 0; 
        memset(dem, 0, sizeof(dem));
        memset(flag, 0, sizeof(flag));
        for(int i = 0; i < k; i++){
            if(!num[i]){
                ans++; flag[i] = 1;
            }
        }
        int cnt = 0;
        // cout << mid << "\n";
        for(int i = 1; i <= n; i++){
            dem[a[i]]++;
            if(dem[a[i]] >= num[a[i]]){
                if(!flag[a[i]]) flag[a[i]] = 1, ans++;
            }
            if(i > mid){
                if(dem[a[i - mid]] == num[a[i - mid]]){
                    if(flag[a[i - mid]]) flag[a[i - mid]] = 0, ans--;
                }
                dem[a[i - mid]]--;
            }
            answer = max(answer, ans);
            // cout << ans <<" ";
        }
        if(answer < k) l = mid + 1;
        else r = mid;
    }
    if(r == n + 1) cout << "impossible";
    else cout << r;
}
 
signed main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
    rng.seed((int)main ^ time(0));
    #ifdef Kawaii
        auto starttime = chrono::high_resolution_clock::now();
    #endif
 
    cin >> n >> k >> r;
    for(int i = 1; i <= n; i++) cin >> a[i];
    solve();
 
    #ifdef Kawaii
        auto endtime = chrono::high_resolution_clock::now();
        auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count(); 
        cout << "\n=====" << "\nUsed: " << duration << " ms\n";
    #endif
}

Compilation message

dna.cpp: In function 'void solve()':
dna.cpp:25:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |         int mid = l + r >> 1, ans = 0, answer = 0;
      |                   ~~^~~
dna.cpp:33:13: warning: unused variable 'cnt' [-Wunused-variable]
   33 |         int cnt = 0;
      |             ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9144 KB Output is correct
2 Correct 7 ms 9044 KB Output is correct
3 Correct 8 ms 9044 KB Output is correct
4 Correct 8 ms 9140 KB Output is correct
5 Correct 8 ms 9144 KB Output is correct
6 Correct 7 ms 9140 KB Output is correct
7 Correct 9 ms 9044 KB Output is correct
8 Correct 9 ms 9044 KB Output is correct
9 Correct 8 ms 9044 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 9172 KB Output is correct
2 Correct 16 ms 9172 KB Output is correct
3 Correct 16 ms 9192 KB Output is correct
4 Correct 14 ms 9188 KB Output is correct
5 Correct 15 ms 9188 KB Output is correct
6 Correct 16 ms 9172 KB Output is correct
7 Correct 8 ms 9044 KB Output is correct
8 Correct 9 ms 9068 KB Output is correct
9 Correct 13 ms 9148 KB Output is correct
10 Correct 9 ms 9044 KB Output is correct
11 Correct 11 ms 9140 KB Output is correct
12 Correct 7 ms 9068 KB Output is correct
13 Correct 11 ms 9144 KB Output is correct
14 Correct 9 ms 9044 KB Output is correct
15 Correct 11 ms 9044 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 10692 KB Output is correct
2 Correct 53 ms 10588 KB Output is correct
3 Correct 47 ms 10692 KB Output is correct
4 Correct 46 ms 10708 KB Output is correct
5 Correct 50 ms 10708 KB Output is correct
6 Correct 36 ms 10708 KB Output is correct
7 Correct 45 ms 10604 KB Output is correct
8 Correct 61 ms 10732 KB Output is correct
9 Correct 57 ms 10708 KB Output is correct
10 Correct 45 ms 10580 KB Output is correct
11 Correct 15 ms 9176 KB Output is correct
12 Correct 12 ms 9172 KB Output is correct
13 Correct 13 ms 9172 KB Output is correct
14 Correct 14 ms 9188 KB Output is correct
15 Correct 14 ms 9192 KB Output is correct
16 Correct 16 ms 9172 KB Output is correct
17 Correct 7 ms 9044 KB Output is correct
18 Correct 9 ms 9044 KB Output is correct
19 Correct 9 ms 9140 KB Output is correct
20 Correct 8 ms 9044 KB Output is correct
21 Correct 8 ms 9044 KB Output is correct
22 Correct 6 ms 9044 KB Output is correct
23 Correct 7 ms 9144 KB Output is correct
24 Correct 8 ms 9028 KB Output is correct
25 Correct 7 ms 9044 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 11220 KB Output is correct
2 Correct 68 ms 11084 KB Output is correct
3 Correct 80 ms 11160 KB Output is correct
4 Correct 52 ms 10708 KB Output is correct
5 Correct 70 ms 11468 KB Output is correct
6 Correct 115 ms 12096 KB Output is correct
7 Correct 62 ms 10752 KB Output is correct
8 Correct 78 ms 10852 KB Output is correct
9 Correct 45 ms 10688 KB Output is correct
10 Correct 59 ms 10688 KB Output is correct
11 Correct 50 ms 10692 KB Output is correct
12 Correct 49 ms 10708 KB Output is correct
13 Correct 55 ms 10732 KB Output is correct
14 Correct 37 ms 10652 KB Output is correct
15 Correct 38 ms 10688 KB Output is correct
16 Correct 66 ms 10616 KB Output is correct
17 Correct 51 ms 10716 KB Output is correct
18 Correct 50 ms 10708 KB Output is correct
19 Correct 12 ms 9176 KB Output is correct
20 Correct 12 ms 9172 KB Output is correct
21 Correct 16 ms 9196 KB Output is correct
22 Correct 13 ms 9212 KB Output is correct
23 Correct 12 ms 9172 KB Output is correct
24 Correct 14 ms 9184 KB Output is correct
25 Correct 10 ms 9044 KB Output is correct
26 Correct 9 ms 9044 KB Output is correct
27 Correct 10 ms 9044 KB Output is correct
28 Correct 10 ms 9044 KB Output is correct
29 Correct 10 ms 9044 KB Output is correct
30 Correct 7 ms 9044 KB Output is correct
31 Correct 11 ms 9044 KB Output is correct
32 Correct 8 ms 9140 KB Output is correct
33 Correct 8 ms 9044 KB Output is correct