oj.uz

Submission #1056801

# Submission time Handle Problem Language Result Execution time Memory
1056801 2024-08-13T11:21:45 Z mindiyak Martian DNA (BOI18_dna) C++14
100 / 100
 23 ms 4692 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}
 
int n,r,k;
 
void solve()
{
    cin >> n >> k >> r;
    vi arr(n);
    FOR(i,0,n)cin >> arr[i];
 
    vi needed(k,0);
    int counter = 0;
    FOR(i,0,r){
        int a,b;cin >> a >> b;
        if(b == 0)counter ++;
        needed[a] = b;
    }
    r = r-counter;
 
    if(r == 0){
        cout << 0 << endl;
        return;
    } 
 
    int ans = n+1;
 
    int s = 0,e = 0,cnt = 0;
    vi tmp = needed;

    while(e < n){
        while(cnt < r && e < n){
            if(needed[arr[e]] > 0){
                tmp[arr[e]] --;
                if(tmp[arr[e]] == 0){
                    cnt ++;
                }
            }
            e++;
        }

        while(cnt == r && s < e){
            ans = min(ans,e-s);
            if(needed[arr[s]] > 0){
                tmp[arr[s]] ++;
                if(tmp[arr[s]] == 1){
                    cnt --;
                }
            }
            s++;
        }
    }
 
 
    if(ans != n+1){
        cout << ans << endl;
        return;
    }
    cout << "impossible" << endl;
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

dna.cpp: In function 'void init(std::string)':
dna.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dna.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1116 KB Output is correct
2 Correct 7 ms 1616 KB Output is correct
3 Correct 8 ms 1628 KB Output is correct
4 Correct 7 ms 1628 KB Output is correct
5 Correct 10 ms 2900 KB Output is correct
6 Correct 6 ms 1628 KB Output is correct
7 Correct 7 ms 1816 KB Output is correct
8 Correct 13 ms 4060 KB Output is correct
9 Correct 8 ms 2140 KB Output is correct
10 Correct 6 ms 1628 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1772 KB Output is correct
2 Correct 14 ms 3144 KB Output is correct
3 Correct 11 ms 2908 KB Output is correct
4 Correct 6 ms 1624 KB Output is correct
5 Correct 17 ms 4188 KB Output is correct
6 Correct 23 ms 4692 KB Output is correct
7 Correct 11 ms 2336 KB Output is correct
8 Correct 12 ms 2592 KB Output is correct
9 Correct 6 ms 1628 KB Output is correct
10 Correct 8 ms 1628 KB Output is correct
11 Correct 9 ms 1628 KB Output is correct
12 Correct 8 ms 1620 KB Output is correct
13 Correct 9 ms 2908 KB Output is correct
14 Correct 8 ms 1644 KB Output is correct
15 Correct 6 ms 1828 KB Output is correct
16 Correct 11 ms 3932 KB Output is correct
17 Correct 8 ms 2260 KB Output is correct
18 Correct 6 ms 1620 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct