oj.uz

답안 #101609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
101609 2019-03-19T05:11:09 Z shibh308 Construction of Highway (JOI18_construction) C++17
16 / 100
 2000 ms 18364 KB 
#include <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = 1e18+7;

// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10)) のように書く
template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(value),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

// lambda式を用いた再帰
template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

// 多次元vectorの一斉初期化 makeVector<i64, 0>(a, b, ...)のように書く
template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

// 最大値を更新し、更新できた時にはtrueを返す
template <typename T = i64>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

// 同様に最小値を更新する
template <typename T = i64>
bool chmin(T& a, T b){
    if(a > b){
        a = b;
        return true;
    }
    return false;
}

// 行数と変数名、値をclogに表示するデバッグ用print
#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;

// 同様の配列向けデバッグ用print
#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);

void _dump(int, string& x){
    clog << x << endl;
}

template <typename T>
void _dump(bool, T& x){
    clog << x << " ";
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){

    for(auto& elm : x)
        _dump(0, elm);

    clog << endl;
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

// input用の関数群
void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}

template<typename T>
struct Compression{
    vector<T> compvec;
    void Comp(vector<T>& inp){//圧縮する
        compvec = inp;
        sort(compvec.begin(), compvec.end());
        compvec.erase(unique(compvec.begin(), compvec.end()), compvec.end());
    }
    int Index(T val){//圧縮を元に対応するインデックスを返す
        auto it = lower_bound(compvec.begin(), compvec.end(), val);
        return (*it == val ? distance(compvec.begin(), it) : -1);
    }
};

template <typename T>
struct BIT{
    vector<T> elm;
    BIT(int n, T init = T()) : elm(n + 1, init){
    }

    // [0, x)
    T sum(int x){
        T val = 0;
        for(; x > 0; x -= x & -x)
            val += elm[x];
        return val;
    }

    void add(int x, T val){
        for(++x; x < elm.size(); x += x & -x)
            elm[x] += val;
    }
};

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n;
    input(n);
    vector<int> c(n), a(n - 1), b(n - 1);
    input(c);
    auto edges = makeVector<int>(n, 0);
    vector<int> par(n, -1);
    pararell_input(n - 1, a, b);
    for(int i = 0; i < n - 1; ++i){
        auto& x = a[i];
        auto& y = b[i];
        --x, --y;
        par[y] = x;
        edges[x].emplace_back(y);
        edges[y].emplace_back(x);
    }

    auto child = makeVector<i64>(n, 0);
    bitset<100001> bs;
    auto f = makeRec([&](auto&& f, int pos) -> void{
        for(auto& ed : edges[pos]){
            if(!bs[ed]){
                bs.set(ed);
                child[pos].emplace_back(ed);
                f(ed);
            }
        }
    });
    bs.set(0);
    f(0);

    for(const auto& i : Range<>(n - 1)){
        int p = b[i];
        vector<int> v;
        while(par[p] != -1){
            p = par[p];
            v.emplace_back(p);
        }
        reverse(v.begin(), v.end());
        vector<int> compvec;
        for(auto& p : v)
            compvec.emplace_back(-c[p]);
        Compression<int> comp;
        comp.Comp(compvec);
        int m = compvec.size();
        BIT<int> bit(m);
        i64 cost = 0;
        for(auto& j : v){
            int val_ind = comp.Index(-c[j]);
            bit.add(val_ind, 1);
            cost += bit.sum(val_ind);
        }
        for(auto& j : v)
            c[j] = c[b[i]];
        cout << cost << endl;
    }


}

Compilation message

construction.cpp: In instantiation of 'void BIT<T>::add(int, T) [with T = int]':
construction.cpp:256:31:   required from here
construction.cpp:197:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(++x; x < elm.size(); x += x & -x)

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 356 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 10 ms 484 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 9 ms 412 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 5 ms 432 KB Output is correct
22 Correct 4 ms 452 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 4 ms 356 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 10 ms 512 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 412 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 4 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 6 ms 384 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 356 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 10 ms 484 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 9 ms 412 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 5 ms 432 KB Output is correct
22 Correct 4 ms 452 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 4 ms 356 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 10 ms 512 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 412 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 4 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 6 ms 512 KB Output is correct
46 Correct 15 ms 896 KB Output is correct
47 Correct 15 ms 904 KB Output is correct
48 Correct 13 ms 896 KB Output is correct
49 Correct 334 ms 1136 KB Output is correct
50 Correct 357 ms 1152 KB Output is correct
51 Correct 299 ms 1136 KB Output is correct
52 Correct 170 ms 956 KB Output is correct
53 Correct 160 ms 912 KB Output is correct
54 Correct 175 ms 1100 KB Output is correct
55 Correct 186 ms 980 KB Output is correct
56 Correct 155 ms 988 KB Output is correct
57 Correct 15 ms 896 KB Output is correct
58 Correct 16 ms 904 KB Output is correct
59 Correct 19 ms 916 KB Output is correct
60 Correct 15 ms 896 KB Output is correct
61 Correct 163 ms 1148 KB Output is correct
62 Correct 180 ms 984 KB Output is correct
63 Correct 164 ms 1008 KB Output is correct
64 Correct 15 ms 884 KB Output is correct
65 Correct 15 ms 912 KB Output is correct
66 Correct 15 ms 896 KB Output is correct
67 Correct 18 ms 896 KB Output is correct
68 Correct 321 ms 1144 KB Output is correct
69 Correct 147 ms 988 KB Output is correct
70 Correct 160 ms 1076 KB Output is correct
71 Correct 151 ms 1060 KB Output is correct
72 Correct 14 ms 868 KB Output is correct
73 Correct 16 ms 864 KB Output is correct
74 Correct 166 ms 1144 KB Output is correct
75 Correct 107 ms 916 KB Output is correct
76 Correct 65 ms 920 KB Output is correct
77 Correct 51 ms 892 KB Output is correct
78 Correct 76 ms 900 KB Output is correct
79 Correct 56 ms 896 KB Output is correct
80 Correct 44 ms 888 KB Output is correct
81 Correct 78 ms 896 KB Output is correct
82 Correct 87 ms 896 KB Output is correct
83 Correct 47 ms 896 KB Output is correct
84 Correct 95 ms 908 KB Output is correct
85 Correct 82 ms 888 KB Output is correct
86 Correct 50 ms 812 KB Output is correct

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 356 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 10 ms 484 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 9 ms 412 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 5 ms 432 KB Output is correct
22 Correct 4 ms 452 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 4 ms 356 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 10 ms 512 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 412 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 4 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 6 ms 384 KB Output is correct
45 Correct 6 ms 512 KB Output is correct
46 Correct 15 ms 896 KB Output is correct
47 Correct 15 ms 904 KB Output is correct
48 Correct 13 ms 896 KB Output is correct
49 Correct 334 ms 1136 KB Output is correct
50 Correct 357 ms 1152 KB Output is correct
51 Correct 299 ms 1136 KB Output is correct
52 Correct 170 ms 956 KB Output is correct
53 Correct 160 ms 912 KB Output is correct
54 Correct 175 ms 1100 KB Output is correct
55 Correct 186 ms 980 KB Output is correct
56 Correct 155 ms 988 KB Output is correct
57 Correct 15 ms 896 KB Output is correct
58 Correct 16 ms 904 KB Output is correct
59 Correct 19 ms 916 KB Output is correct
60 Correct 15 ms 896 KB Output is correct
61 Correct 163 ms 1148 KB Output is correct
62 Correct 180 ms 984 KB Output is correct
63 Correct 164 ms 1008 KB Output is correct
64 Correct 15 ms 884 KB Output is correct
65 Correct 15 ms 912 KB Output is correct
66 Correct 15 ms 896 KB Output is correct
67 Correct 18 ms 896 KB Output is correct
68 Correct 321 ms 1144 KB Output is correct
69 Correct 147 ms 988 KB Output is correct
70 Correct 160 ms 1076 KB Output is correct
71 Correct 151 ms 1060 KB Output is correct
72 Correct 14 ms 868 KB Output is correct
73 Correct 16 ms 864 KB Output is correct
74 Correct 166 ms 1144 KB Output is correct
75 Correct 107 ms 916 KB Output is correct
76 Correct 65 ms 920 KB Output is correct
77 Correct 51 ms 892 KB Output is correct
78 Correct 76 ms 900 KB Output is correct
79 Correct 56 ms 896 KB Output is correct
80 Correct 44 ms 888 KB Output is correct
81 Correct 78 ms 896 KB Output is correct
82 Correct 87 ms 896 KB Output is correct
83 Correct 47 ms 896 KB Output is correct
84 Correct 95 ms 908 KB Output is correct
85 Correct 82 ms 888 KB Output is correct
86 Correct 50 ms 812 KB Output is correct
87 Correct 36 ms 1732 KB Output is correct
88 Correct 143 ms 4472 KB Output is correct
89 Correct 483 ms 14232 KB Output is correct
90 Correct 461 ms 14172 KB Output is correct
91 Correct 512 ms 14128 KB Output is correct
92 Execution timed out 2089 ms 18364 KB Time limit exceeded
93 Halted 0 ms 0 KB -