oj.uz

답안 #932514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932514 2024-02-23T14:42:30 Z 12345678 Martian DNA (BOI18_dna) C++17
0 / 100
 88 ms 25424 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];
    void update(int l, int r, int i, int ql, int qr, int vl)
    {
        if (qr<l||r<ql) return;
        if (ql<=l&&r<=qr) return d[i]=min(d[i], vl), 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)
    {
        if (l==r) return ans=min(ans, (d[i]!=INT_MIN)?l-d[i]+1:INT_MAX),void(); //cout<<l<<' '<<d[i]<<'\n', void();
        int md=(l+r)/2;
        d[2*i]=min(d[2*i], d[i]);
        solve(l, md, 2*i);
        d[2*i+1]=min(d[2*i+1], d[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]); //cout<<"update "<<d[b][j-1]<<' '<<d[b][j]-1<<' '<<d[b][j-q]<<'\n';
        //cout<<"ask\n";
        //s.solve(1,n , 1);
    }
    s.solve(1,n , 1);
    if (ans==INT_MAX) cout<<"impossible";
    else cout<<ans;
}

Compilation message

dna.cpp: In function 'int main()':
dna.cpp:42:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         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]); //cout<<"update "<<d[b][j-1]<<' '<<d[b][j]-1<<' '<<d[b][j-q]<<'\n';
      |                       ~^~~~~~~~~~~~

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 9048 KB Output is correct
5 Incorrect 3 ms 8796 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Incorrect 2 ms 8796 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 10844 KB Output is correct
2 Correct 21 ms 10516 KB Output is correct
3 Correct 32 ms 10376 KB Output is correct
4 Correct 26 ms 10804 KB Output is correct
5 Correct 21 ms 12196 KB Output is correct
6 Correct 11 ms 10632 KB Output is correct
7 Correct 15 ms 10528 KB Output is correct
8 Correct 28 ms 15708 KB Output is correct
9 Correct 18 ms 10844 KB Output is correct
10 Correct 26 ms 10748 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 3 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8792 KB Output is correct
15 Correct 2 ms 8792 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 2 ms 8796 KB Output is correct
18 Correct 2 ms 8804 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Incorrect 2 ms 8796 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 12120 KB Output is correct
2 Correct 73 ms 11608 KB Output is correct
3 Correct 41 ms 11608 KB Output is correct
4 Correct 26 ms 10484 KB Output is correct
5 Runtime error 31 ms 25424 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -