Submission #1129668

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129668		KasymK	Martian DNA (BOI18_dna)	C++20	0 / 100	35 ms	2632 KiB

dna

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
const int INF = 1e9;
int v[N], req[N], sm[N];

int main(){
    int n, k, q;
    scanf("%d%d%d", &n, &k, &q);
    for(int i = 1; i <= n; ++i)
        scanf("%d", v+i);
    memset(req, -1, sizeof req);
    for(int i = 1; i <= q; ++i){
        int a, b;
        scanf("%d%d", &a, &b);
        req[a]=b;
    }
    int id=1, cnt=0, answer=INF;
    for(int i = 1; i <= n; ++i){
        sm[v[i]]++;
        if(sm[v[i]]==req[v[i]])
            cnt++;
        while(sm[v[id]]>req[v[id]] or req[v[id]]==-1)
            sm[v[id]]--, id++;
        if(cnt==q)
            umin(answer, i-id+1);
    }
    if(answer==INF)
        puts("impossible");
    else
        printf("%d\n", answer);
    return 0;
}

Compilation message (stderr)

dna.cpp: In function 'int main()':
dna.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d%d%d", &n, &k, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
dna.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", v+i);
      |         ~~~~~^~~~~~~~~~~
dna.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~

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