oj.uz

답안 #759244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759244 2023-06-15T22:51:57 Z Charizard2021 Paprike (COI18_paprike) C++17
100 / 100
 98 ms 20620 KB 
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};
void selfMax(int& a, int b){
    a = max(a, b);
}
void selfMin(int& a, int b){
    a = min(a, b);
}
/*

Use DSU dsu(N);

*/
struct DSU {
	vector<int> e;
	DSU(int N) { e = vector<int>(N, -1); }

	// get representive component (uses path compression)
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

	bool same_set(int a, int b) { return get(a) == get(b); }

	int size(int x) { return -e[get(x)]; }

	bool unite(int x, int y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y]; e[y] = x;
		return true;
	}
};
/*

Run with Bit<int> BIT

*/
template <class T> class BIT {
    private:
        int size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(int size) : size(size), bit(size + 1), arr(size) {}
        void set(int ind, int val) { add(ind, val - arr[ind]); }
        void add(int ind, int val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(int ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<int> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	int n; vector<T> seg;
	void init(int _n) { n = _n; seg.assign(2*n,ID); }
	void pull(int p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(int p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(int l, int r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
const int N = 100001;
vector<int> adj[N];
int parents[N];
int levels[N];
vector<int> levelsToIdx[N];
void dfs(int u, int p){
    parents[u] = p;
    for(int v : adj[u]){
        if(v != p){
            levels[v] = levels[u] + 1;
            dfs(v, u);
        }
    }
}
int main(){
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    cin >> v;
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(0, -1);
    for(int i = 0; i < n; i++){
        levelsToIdx[levels[i]].push_back(i);
    }
    int ans =0;
    for(int i = n - 1; i > 0; i--){
        sort(levelsToIdx[i].begin(), levelsToIdx[i].end(), [&](int a, int b){
            return v[a] < v[b];
        });
        for(int u : levelsToIdx[i]){
            if(v[u] + v[parents[u]] <= k){
                v[parents[u]] += v[u];
            }
            else{
                ans++;
            }
        }
    }
    cout << ans << "\n";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 5004 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5004 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 5000 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 19716 KB Output is correct
2 Correct 82 ms 20600 KB Output is correct
3 Correct 82 ms 20616 KB Output is correct
4 Correct 82 ms 20620 KB Output is correct
5 Correct 80 ms 20608 KB Output is correct
6 Correct 82 ms 20556 KB Output is correct
7 Correct 80 ms 20556 KB Output is correct
8 Correct 88 ms 20084 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 5004 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5004 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 5000 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5016 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 4960 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 5012 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 5012 KB Output is correct
38 Correct 3 ms 5012 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 5004 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5000 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 5004 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 5000 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 98 ms 19716 KB Output is correct
23 Correct 82 ms 20600 KB Output is correct
24 Correct 82 ms 20616 KB Output is correct
25 Correct 82 ms 20620 KB Output is correct
26 Correct 80 ms 20608 KB Output is correct
27 Correct 82 ms 20556 KB Output is correct
28 Correct 80 ms 20556 KB Output is correct
29 Correct 88 ms 20084 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5016 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 4960 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 5012 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 4948 KB Output is correct
45 Correct 3 ms 5012 KB Output is correct
46 Correct 3 ms 5012 KB Output is correct
47 Correct 85 ms 14448 KB Output is correct
48 Correct 81 ms 13152 KB Output is correct
49 Correct 80 ms 12808 KB Output is correct
50 Correct 80 ms 12548 KB Output is correct
51 Correct 95 ms 11896 KB Output is correct
52 Correct 83 ms 11908 KB Output is correct
53 Correct 83 ms 11772 KB Output is correct
54 Correct 82 ms 11784 KB Output is correct
55 Correct 72 ms 11312 KB Output is correct
56 Correct 75 ms 11308 KB Output is correct
57 Correct 67 ms 12036 KB Output is correct