Submission #815748

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
815748	2023-08-08T20:50:14 Z	TB_	Martian DNA (BOI18_dna)	C++17	100 / 100	132 ms	7804 KB

#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, k, m, q, val;
    cin >> n >> k >> m;
    vi v(n);
    fo(i, n){
        cin >> v[i];
    }
    map<int, int> quantity;
    fo(i, m){
        cin >> val >> q;
        quantity[val] = q;
    }
    
    int ans = INF;
    int completed = 0, lo = 0, hi = 0;

    while(true){
        if(completed == m){
            ans = min(ans, hi-lo);
            if(quantity.count(v[lo])) {
                quantity[v[lo]]++;
                if(quantity[v[lo]] == 1)
                    completed--;
            }
            lo++;
        }else{
            if(hi == n) break;
            if(quantity.count(v[hi])) {
                quantity[v[hi]]--;
                if(quantity[v[hi]] == 0)
                    completed++;
            }
            hi++;
        }
    }
    cout << (ans==INF?"impossible":to_string(ans));

    return 0;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct

Subtask #2
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	356 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	320 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	1492 KB	Output is correct
2	Correct	10 ms	1492 KB	Output is correct
3	Correct	14 ms	1492 KB	Output is correct
4	Correct	13 ms	1484 KB	Output is correct
5	Correct	17 ms	2260 KB	Output is correct
6	Correct	13 ms	1492 KB	Output is correct
7	Correct	12 ms	1620 KB	Output is correct
8	Correct	18 ms	2248 KB	Output is correct
9	Correct	16 ms	2004 KB	Output is correct
10	Correct	17 ms	1492 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	132 ms	6608 KB	Output is correct
2	Correct	119 ms	5452 KB	Output is correct
3	Correct	62 ms	3280 KB	Output is correct
4	Correct	9 ms	1492 KB	Output is correct
5	Correct	99 ms	6912 KB	Output is correct
6	Correct	122 ms	7804 KB	Output is correct
7	Correct	55 ms	2388 KB	Output is correct
8	Correct	76 ms	2892 KB	Output is correct
9	Correct	12 ms	1484 KB	Output is correct
10	Correct	10 ms	1492 KB	Output is correct
11	Correct	14 ms	1492 KB	Output is correct
12	Correct	13 ms	1484 KB	Output is correct
13	Correct	17 ms	2248 KB	Output is correct
14	Correct	13 ms	1392 KB	Output is correct
15	Correct	12 ms	1620 KB	Output is correct
16	Correct	18 ms	2260 KB	Output is correct
17	Correct	16 ms	1996 KB	Output is correct
18	Correct	17 ms	1492 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct

Submission #815748

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 28.0 / 28.0

Subtask #4 32.0 / 32.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
28.0 / 28.0

Subtask #4
32.0 / 32.0