oj.uz

답안 #542749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542749 2022-03-27T21:48:53 Z Olympia Nekameleoni (COCI15_nekameleoni) C++17
0 / 140
 3000 ms 158500 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>

using namespace std;
class Node {
public:
    map<int64_t,int> left;
    map<int64_t,int> right;
    int64_t bor = 0;
    int tot = 0;
    int length = 0;
    bool okay = true;
    void print () {
        cout << "LEFT\n";
        for (auto& p: left) cout << p.first << " " << p.second << '\n';
        cout << "RIGHT\n";
        for (auto& p: right) cout << p.first << " " << p.second << '\n';
        cout << "LENGTH\n";
        cout << length << '\n';
        cout << "TOT\n";
        cout << tot << '\n';
        cout << "BOR\n";
        cout << bor << '\n';
        cout << '\n';
    }
};
vector<int64_t> powr;
Node generate (int64_t x) {
    Node ans;
    ans.left[powr[x]] = 1;
    ans.left[0] = 0;
    ans.right[powr[x]] = 1;
    ans.right[0] = 0;
    ans.tot = 1;
    ans.bor = powr[x];
    ans.length = 1;
    return ans;
}
Node merge (Node x, Node y) {
    if (!x.okay) return y;
    if (!y.okay) return x;
    Node ans;
    ans.left = x.left;
    ans.right = y.right;
    for (auto& p: y.left) {
        if (ans.left[p.first | x.bor] == 0 || ans.left[p.first | x.bor] >= p.second + x.length) {
            ans.left[p.first | x.bor] = p.second + x.length;
        }
    }
    for (auto& p: x.right) {
        if (ans.right[p.first | y.bor] == 0 || ans.right[p.first | y.bor] >= p.second + y.length) {
            ans.right[p.first | y.bor] = p.second + y.length;
        }
    }
    ans.bor = x.bor | y.bor;
    ans.tot = INT_MAX;
    ans.length = x.length + y.length;
    if (x.bor == y.bor) {
        ans.tot = min(x.tot, y.tot);
    }
    for (auto& p: x.right) {
        for (auto& q: y.left) {
            if ((p.first | q.first) == ans.bor) {
                ans.tot = min(ans.tot, p.second + q.second);
            }
        }
    }
    ans.left[0] = ans.right[0] = 0;
    return ans;
}
template<class T>
class SegmentTree {
public:

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

    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]);
        }
    }

    void build (int dum, vector<int>& arr, int tl, int tr) {
        if (tl == tr) {
            if (tl < arr.size()) val[dum] = generate(arr[tl]);
            else val[dum] = generate(0);
            return;
        }
        build(2 * dum + 1, arr, tl, (tl + tr)/2);
        build(2 * dum + 2, arr, (tl + tr)/2 + 1, tr);
        val[dum] = merge(val[2 * dum + 1], val[2 * dum + 2]);
    }

    void build (vector<int> arr) {
        build(0,  arr, 0, N - 1);
    }

    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);
    }
    vector<T> val;
private:
    T ID;
    int N;
};
int main() {
    //freopen("balancing.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K, M;
    cin >> N >> K >> M;
    SegmentTree<Node> st(N);
    vector<int> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    powr = {1};
    for (int i = 0; i < 50; i++) {
        powr.push_back(powr.back() * 2);
    }
    st.build(arr);
    while (M--) {
        int t;
        cin >> t;
        if (t == 2) {
            if (st.val[0].bor == powr[K + 1] - 2) {
                cout << st.val[0].tot << '\n';
            } else {
                cout << "-1\n";
            }
        } else {
            int p, v; cin >> p >> v; p--;
            st.update(p, generate(v));
        }
    }
}

Compilation message

nekameleoni.cpp: In instantiation of 'void SegmentTree<T>::build(int, std::vector<int>&, int, int) [with T = Node]':
nekameleoni.cpp:112:14:   required from 'void SegmentTree<T>::build(std::vector<int>) [with T = Node]'
nekameleoni.cpp:148:17:   required from here
nekameleoni.cpp:102:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             if (tl < arr.size()) val[dum] = generate(arr[tl]);
      |                 ~~~^~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 105 ms 4784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 373 ms 8716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 825 ms 9420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 14.0

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

Subtask #7
0 / 14.0

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

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

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