oj.uz

답안 #545512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545512 2022-04-04T17:08:09 Z SmolBrain Paprike (COI18_paprike) C++17
100 / 100
 53 ms 20300 KB 
// Om Namah Shivaya
// GM in 120 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[maxn], a(maxn), val(maxn);
ll ans = 0;
ll n, k;

void dfs(ll node, ll par) {
    val[node] = a[node];
    vector<ll> subtreevals;

    trav(child, adj[node]) {
        if (child == par) conts;
        dfs(child, node);

        val[node] += val[child];
        subtreevals.pb(val[child]);
    }

    sort(rall(subtreevals));

    trav(x, subtreevals) {
        if (val[node] <= k) break;

        val[node] -= x;
        ans++;
    }
}

void solve(int test_case)
{
    cin >> n >> k;
    rep1(i, n) cin >> a[i];
    rep1(i, n - 1) {
        ll u, v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    dfs(1, -1);
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

paprike.cpp: In function 'void usaco(std::string)':
paprike.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 20208 KB Output is correct
2 Correct 44 ms 20300 KB Output is correct
3 Correct 42 ms 20224 KB Output is correct
4 Correct 42 ms 20240 KB Output is correct
5 Correct 42 ms 20196 KB Output is correct
6 Correct 44 ms 20136 KB Output is correct
7 Correct 43 ms 20244 KB Output is correct
8 Correct 38 ms 19696 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4260 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 2 ms 4272 KB Output is correct
23 Correct 3 ms 4308 KB Output is correct
24 Correct 3 ms 4308 KB Output is correct
25 Correct 3 ms 4272 KB Output is correct
26 Correct 2 ms 4264 KB Output is correct
27 Correct 3 ms 4308 KB Output is correct
28 Correct 3 ms 4268 KB Output is correct
29 Correct 3 ms 4308 KB Output is correct
30 Correct 3 ms 4248 KB Output is correct
31 Correct 3 ms 4180 KB Output is correct
32 Correct 2 ms 4308 KB Output is correct
33 Correct 3 ms 4272 KB Output is correct
34 Correct 2 ms 4308 KB Output is correct
35 Correct 3 ms 4308 KB Output is correct
36 Correct 3 ms 4180 KB Output is correct
37 Correct 2 ms 4264 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4260 KB Output is correct
3 Correct 2 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 2 ms 4180 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4180 KB Output is correct
11 Correct 2 ms 4180 KB Output is correct
12 Correct 2 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 2 ms 4180 KB Output is correct
15 Correct 2 ms 4180 KB Output is correct
16 Correct 2 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4180 KB Output is correct
19 Correct 2 ms 4180 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 4180 KB Output is correct
22 Correct 46 ms 20208 KB Output is correct
23 Correct 44 ms 20300 KB Output is correct
24 Correct 42 ms 20224 KB Output is correct
25 Correct 42 ms 20240 KB Output is correct
26 Correct 42 ms 20196 KB Output is correct
27 Correct 44 ms 20136 KB Output is correct
28 Correct 43 ms 20244 KB Output is correct
29 Correct 38 ms 19696 KB Output is correct
30 Correct 2 ms 4272 KB Output is correct
31 Correct 3 ms 4308 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 3 ms 4272 KB Output is correct
34 Correct 2 ms 4264 KB Output is correct
35 Correct 3 ms 4308 KB Output is correct
36 Correct 3 ms 4268 KB Output is correct
37 Correct 3 ms 4308 KB Output is correct
38 Correct 3 ms 4248 KB Output is correct
39 Correct 3 ms 4180 KB Output is correct
40 Correct 2 ms 4308 KB Output is correct
41 Correct 3 ms 4272 KB Output is correct
42 Correct 2 ms 4308 KB Output is correct
43 Correct 3 ms 4308 KB Output is correct
44 Correct 3 ms 4180 KB Output is correct
45 Correct 2 ms 4264 KB Output is correct
46 Correct 2 ms 4308 KB Output is correct
47 Correct 41 ms 13720 KB Output is correct
48 Correct 43 ms 12104 KB Output is correct
49 Correct 45 ms 11212 KB Output is correct
50 Correct 43 ms 10888 KB Output is correct
51 Correct 53 ms 9940 KB Output is correct
52 Correct 50 ms 9952 KB Output is correct
53 Correct 47 ms 9884 KB Output is correct
54 Correct 52 ms 9876 KB Output is correct
55 Correct 45 ms 9380 KB Output is correct
56 Correct 50 ms 9356 KB Output is correct
57 Correct 32 ms 11256 KB Output is correct