oj.uz

답안 #790103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790103 2023-07-22T10:34:57 Z TB_ Cat in a tree (BOI17_catinatree) C++17
100 / 100
 73 ms 24604 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<n;i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vvl adj(2e5+1);

int d;

pl solve(int pos, int last = -1){ // closest, sum
    vpl subTrees;
    for(auto v : adj[pos]){
        if(v == last) continue;
        subTrees.pb(solve(v, pos));
    }
    pl ans = {1e16, 0};
    sort(rall(subTrees));

    fo(i, subTrees.size()){
        if(!subTrees[i].S) continue;
        ans.S += subTrees[i].S;
        if(subTrees[i].F+ans.F>=d){
            ans.F = subTrees[i].F;
        }else ans.S--;
    }
    if(ans.F>=d){
        ans.F = 0;
        ans.S++;
    }
    ans.F++;
    return ans;
}

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, to;
    cin >> n >> d;
    fo(i, n-1){
        cin >> to;
        adj[i+1].pb(to);
        adj[to].pb(i+1);
    }
    cout << solve(0).S;

    return 0;
}

Compilation message

catinatree.cpp: In function 'pl solve(int, int)':
catinatree.cpp:20:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | #define fo(i, n) for(int i=0;i<n;i++)
......
   59 |     fo(i, subTrees.size()){
      |        ~~~~~~~~~~~~~~~~~~      
catinatree.cpp:59:5: note: in expansion of macro 'fo'
   59 |     fo(i, subTrees.size()){
      |     ^~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4972 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4972 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5168 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5028 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 4 ms 4956 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 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 5032 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 2 ms 5076 KB Output is correct
34 Correct 3 ms 5076 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 5032 KB Output is correct
38 Correct 3 ms 5028 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4972 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 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 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5168 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 5028 KB Output is correct
25 Correct 2 ms 4948 KB Output is correct
26 Correct 4 ms 4956 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 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 5032 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 2 ms 5076 KB Output is correct
34 Correct 3 ms 5076 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 5032 KB Output is correct
38 Correct 3 ms 5028 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 46 ms 13416 KB Output is correct
42 Correct 22 ms 9300 KB Output is correct
43 Correct 22 ms 9260 KB Output is correct
44 Correct 22 ms 9300 KB Output is correct
45 Correct 22 ms 9268 KB Output is correct
46 Correct 60 ms 13588 KB Output is correct
47 Correct 52 ms 13620 KB Output is correct
48 Correct 52 ms 13644 KB Output is correct
49 Correct 64 ms 13580 KB Output is correct
50 Correct 14 ms 9540 KB Output is correct
51 Correct 14 ms 9556 KB Output is correct
52 Correct 18 ms 9684 KB Output is correct
53 Correct 30 ms 14036 KB Output is correct
54 Correct 29 ms 13992 KB Output is correct
55 Correct 34 ms 14092 KB Output is correct
56 Correct 3 ms 5204 KB Output is correct
57 Correct 7 ms 7892 KB Output is correct
58 Correct 24 ms 18736 KB Output is correct
59 Correct 73 ms 24604 KB Output is correct
60 Correct 49 ms 13896 KB Output is correct
61 Correct 42 ms 12924 KB Output is correct