oj.uz

Submission #939497

# Submission time Handle Problem Language Result Execution time Memory
939497 2024-03-06T12:05:09 Z 12345678 Martian DNA (BOI18_dna) C++17
0 / 100
 165 ms 37872 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5;
int n, v[nx], k, r, res[nx], b, q, ans=INT_MAX;
vector<int> d[nx];

struct segtree
{
    int d[4*nx], lz[4*nx], lzs[4*nx];
    void pushlz(int l, int r, int i)
    {
        if (!lz[i]) return;
        lz[i]=0;
        if (l==r) return d[i]=min(d[i], lzs[i]), void();
        if (!lz[2*i]) lz[2*i]=1, lzs[2*i]=lzs[i];
        else lzs[2*i]=min(lzs[2*i], lzs[i]);
        if (!lz[2*i+1]) lz[2*i+1]=1, lzs[2*i+1]=lzs[i];
        else lzs[2*i+1]=min(lzs[2*i+1], lzs[i]);
    }
    void update(int l, int r, int i, int ql, int qr, int vl)
    {
        pushlz(l, r, i);
        if (qr<l||r<ql||r<l) return;
        if (ql<=l&&r<=qr) return lz[i]=1, lzs[i]=vl, pushlz(l, r, i), void();
        int md=(l+r)/2;
        update(l, md, 2*i, ql, qr, vl);
        update(md+1, r, 2*i+1, ql, qr, vl);
    }
    void solve(int l, int r, int i)
    {
        pushlz(l, r, i);
        if (d[i]==INT_MIN) return;
        if (l==r) return ans=min(ans, l-d[i]+1),void();
        int md=(l+r)/2;
        solve(l, md, 2*i);
        solve(md+1, r, 2*i+1);
    }
} s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k>>r;
    for (int i=1; i<=n; i++) cin>>v[i], d[v[i]].push_back(i);
    for (int i=1; i<4*nx; i++) s.d[i]=INT_MAX;
    for (int i=1; i<=r; i++)
    {
        cin>>b>>q;
        d[b].push_back(n+1);
        s.update(1, n, 1, 1, d[b][q-1]-1, INT_MIN);
        for (int j=q; j<d[b].size(); j++) s.update(1, n, 1, d[b][j-1], d[b][j]-1, d[b][j-q]);
    }
    s.solve(1, n , 1);
    if (ans==INT_MAX) cout<<"impossible";
    else cout<<ans;
}

Compilation message

dna.cpp: In function 'int main()':
dna.cpp:53:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (int j=q; j<d[b].size(); j++) s.update(1, n, 1, d[b][j-1], d[b][j]-1, d[b][j-q]);
      |                       ~^~~~~~~~~~~~

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Incorrect 2 ms 12892 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 5 ms 12888 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 4 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 3 ms 12888 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Incorrect 3 ms 12892 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 16988 KB Output is correct
2 Correct 29 ms 16656 KB Output is correct
3 Correct 58 ms 16636 KB Output is correct
4 Correct 36 ms 16948 KB Output is correct
5 Correct 23 ms 18268 KB Output is correct
6 Correct 18 ms 16988 KB Output is correct
7 Correct 18 ms 16796 KB Output is correct
8 Correct 33 ms 22200 KB Output is correct
9 Correct 20 ms 16988 KB Output is correct
10 Correct 39 ms 16900 KB Output is correct
11 Correct 3 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 4 ms 12888 KB Output is correct
14 Correct 3 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 4 ms 12888 KB Output is correct
17 Correct 3 ms 12892 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12888 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Incorrect 3 ms 12892 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 18260 KB Output is correct
2 Correct 155 ms 17756 KB Output is correct
3 Correct 74 ms 17884 KB Output is correct
4 Correct 49 ms 15340 KB Output is correct
5 Runtime error 37 ms 37872 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -