oj.uz

답안 #548613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548613 2022-04-14T02:08:15 Z Olympia Martian DNA (BOI18_dna) C++17
40 / 100
 2000 ms 1048576 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef long long ll;

using namespace std;
template<class T>
class SegmentTree {
public:

    void resz (int N) {
        N = (1 << ((int)floor(log2(N - 1)) + 1));
        this->N = N;
        val.assign(2 * N, ID);
    }

    void update (int x, T y) {
        x += N - 1;
        val[x] = y;
        while (x != 0) {
            x = (x - 1)/2;
            val[x] = merge(val[2 * x + 1], val[2 * x + 2]);
        }
    }

    T query (int ind, const int l, const int r, int tl, int tr) {
        if (tl >= l && tr <= r) {
            return val[ind];
        }
        if (tr < l || tl > r) {
            return ID;
        }
        return merge(query(2 * ind + 1, l, r, tl, (tl + tr)/2), query(2 * ind + 2, l, r, (tl + tr)/2 + 1, tr));
    }

    T query (int l, int r) {
        return query(0, l, r, 0, N - 1);
    }
private:
    vector<T> val;
    T ID = 0;
    T merge (T x, T y) {
        return x + y;
    }
    int N;
};
vector<SegmentTree<int>> st;
vector<int> arr;
vector<pair<int,int>> queries;
bool okay (int l, int r) {
    int R = queries.size();
    for (int i = 0; i < R; i++) {
        if (st[i].query(l, r) < queries[i].second) {
            return false;
        }
    }
    return true;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K, R;
    cin >> N >> K >> R;
    st.resize(R);
    for (int i = 0; i < R; i++) {
        st[i].resz(N);
    }
    arr.resize(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    queries.resize(R);
    for (int i = 0; i < R; i++) {
        cin >> queries[i].first >> queries[i].second;
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < R; j++) {
            if (arr[i] == queries[j].first) {
                st[j].update(i, 1);
            }
        }
    }
    int myMin = INT_MAX;
    for (int i = 0; i < N; i++) {
        if (!okay(i, N - 1)) {
            break;
        }
        int l = i;
        int r = N - 1;
        while (l != r) {
            int m = (l + r)/2;
            if (okay(i, m)) {
                r = m;
            } else {
                l = m + 1;
            }
        }
        //cout << i << " " << l << '\n';
        myMin = min(myMin, l - i + 1);
    }
    if (myMin == INT_MAX) {
        cout << "impossible\n";
    } else {
        cout << myMin;
    }
}

Compilation message

dna.cpp:14: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   14 | #pragma GCC optimization ("O3")
      | 
dna.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 15 ms 596 KB Output is correct
3 Correct 16 ms 668 KB Output is correct
4 Correct 29 ms 596 KB Output is correct
5 Correct 24 ms 596 KB Output is correct
6 Correct 36 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 224 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2050 ms 19996 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 668 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -