Submission #946564

#	Time	Username	Problem	Language	Result	Execution time	Memory
946564		rahidilbayramli	Martian DNA (BOI18_dna)	C++17	16 / 100	64 ms	34080 KiB

dna

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll sz = 2e5+5;
ll grid[15][sz];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        ll n, k, r, i, j, ans = LLONG_MAX;
        cin >> n >> k >> r;
        vl v(n+5);
        map<ll, ll>mp, w;
        for(i = 1; i <= n; i++)
            cin >> v[i];
        ll f[r+5];
        for(i = 1; i <= r; i++){
            ll x, y;
            cin >> x >> y;
            mp[x] = y;
            f[i] = x;
            w[x] = i;
        }
        for(i = 1; i <= n; i++)
        {
            for(j = 1; j <= r; j++){
                grid[w[f[j]]][i] = grid[w[f[j]]][i-1];
                if(v[i] == f[j])
                    grid[w[f[j]]][i]++;
            }
        }
        for(i = 1; i <= n; i++)
        {
            ll l = i, r = n;
            while(l <= r)
            {
                ll mid = (l + r) / 2;
                bool possible = true;
                for(j = 1; j <= r; j++)
                {
                    ll x = grid[w[f[j]]][mid] - grid[w[f[j]]][i-1];
                    if(x < mp[f[j]]){
                        possible = false;
                        break;
                    }
                }
                if(possible)
                {
                    ans = min(ans, mid - i + 1);
                    r = mid - 1;
                }
                else
                    l = mid + 1;
            }
        }
        if(ans == LLONG_MAX)
            cout << "impossible\n";
        else
            cout << ans << "\n";
    }
}

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