oj.uz

Submission #986384

# Submission time Handle Problem Language Result Execution time Memory
986384 2024-05-20T12:18:20 Z FIFI_cpp Birokracija (COCI18_birokracija) C++17
100 / 100
 80 ms 31568 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
using ll = long long;
#define pb push_back
#define all(a) a.begin(),a.end()
#define int int64_t
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
// xcode cant include bits/stdc++.h
using namespace std;
//ifstream fin ("fenceplan.in");
//ofstream fout ("fenceplan.out");
/*   /\_/\
*   (= ._.)
*   / >  \>
*/
// encouraging cat
const ll INF = 100000000000000;
const ll mod = 1000000007;
vector<vector<int>> adj;
vector<int> res;
int children(int curr)
{
    int s = 0;
    int r = 0;
    for (auto edge: adj[curr])
    {
        s += children(edge);
        r += res[edge];
    }
    res[curr] = r + s + 1;
    return s + 1;
}
int32_t main() {
    int n;
    cin >> n;
    adj.resize(n);
    res.resize(n);
    res[0] = 0;
    for (int i = 1;i < n;i++)
    {
        int from;
        cin >> from;
        from--;
        adj[from].pb(i);
        res[i] = 0;
    }
    children(0);
    for (int i = 0;i < n;i++)
    {
        cout << res[i] << " ";
    }
    cout << '\n';
    return 0;
}

Compilation message

birokracija.cpp:31:9: warning: "/*" within comment [-Wcomment]
   31 | /*   /\_/\
      |

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1372 KB Output is correct
2 Correct 9 ms 1884 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4368 KB Output is correct
2 Correct 24 ms 4440 KB Output is correct
3 Correct 31 ms 5872 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 10732 KB Output is correct
2 Correct 70 ms 13704 KB Output is correct
3 Correct 80 ms 31568 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 10840 KB Output is correct
2 Correct 78 ms 12224 KB Output is correct
3 Correct 73 ms 15188 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 10464 KB Output is correct
2 Correct 69 ms 12468 KB Output is correct
3 Correct 71 ms 18188 KB Output is correct