Submission #768046

#	Time	Username	Problem	Language	Result	Execution time	Memory
768046		raysh07	Martian DNA (BOI18_dna)	C++17	100 / 100	151 ms	140036 KiB

dna

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int n, k, r;
const int N = 2e5 + 69;
int a[N], need[N];
deque <int> pos[N];

void Solve() 
{
    cin >> n >> k >> r;
    for (int i = 1; i <= n; i++) cin >> a[i], pos[a[i]].push_back(i);
    
    while(r--){
        int x, y; cin >> x >> y;
        need[x] = y;
        if (y > pos[x].size()){
            cout << "impossible\n";
            return;
        }
    }
    
    int ans = n;
    int mx = -1;
    for (int i = 0; i < k; i++){
        if (need[i] != 0){
            mx = max(mx, pos[i][need[i] - 1]);
        }
    }
    
    for (int i = 1; i <= n; i++){
        ans = min(ans, mx - i + 1);
        pos[a[i]].pop_front();
        if (pos[a[i]].size() < need[a[i]]) break;
        if (need[a[i]] != 0) mx = max(mx, pos[a[i]][need[a[i]] - 1]);
    }
    
    cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
//    cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Compilation message (stderr)

dna.cpp: In function 'void Solve()':
dna.cpp:23:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if (y > pos[x].size()){
      |             ~~^~~~~~~~~~~~~~~
dna.cpp:40:30: warning: comparison of integer expressions of different signedness: 'std::deque<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   40 |         if (pos[a[i]].size() < need[a[i]]) break;
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

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