oj.uz

Submission #943858

# Submission time Handle Problem Language Result Execution time Memory
943858 2024-03-12T02:48:43 Z Boycl07 Fireworks (APIO16_fireworks) C++17
26 / 100
 13 ms 39272 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define rep(i, n) for(int i = 1; (i) <= (n); ++i)
#define forn(i, l, r) for(int i = (l); i <= (r); ++i)
#define ford(i, r, l) for(int i = (r); i >= (l); --i)
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define FORD(i, n) for(int i = ((n) - 1); i >= 0; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "firework"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)

template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }

inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}


const int N =  6e5 + 10;
const int M = 1e3 + 3;
const int N1 = 2e3 + 10;
const int K = 1e2 + 1;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll LINF = 1e17 + 2;
const int block_size = 500;
const int LOG = 40;
const int offset = N;
const int LIM = 11 ;
const int AL = 26;

int n, m;

priority_queue<ll> q[N];
ll a[N], b[N], c[N];
vector<int> g[N];

void dfs(int u)
{
    if(u > n)
    {
        a[u] = 1;
        b[u] = -c[u];
        q[u].push(c[u]);
        q[u].push(c[u]);
    }
    else
    {
        for(int v : g[u])
        {
            dfs(v);
            if(sz(q[u]) < sz(q[v])) swap(q[u], q[v]);
            a[u] += a[v]; b[u] += b[v];

            while(sz(q[v]))
            {
                q[u].push(q[v].top());
                q[v].pop();
            }
        }
        while(a[u] > 1)
        {
            --a[u];
            b[u] += q[u].top();
            q[u].pop();
        }
        if(u != 1)
        {
            int slope_1 = q[u].top(); q[u].pop();
            int slope_0 = q[u].top(); q[u].pop();
            q[u].push(slope_1 + c[u]);
            q[u].push(slope_0 + c[u]);
            b[u] -= c[u];
        }
        else
        {
            --a[u];
            b[u] += q[u].top();
            q[u].pop();
        }
    }
}

void solve()
{
    cin >> n >> m;
    forn(i, 2, n + m)
    {
        int x;
        cin >> x >> c[i];
        g[x].pb(i);
    }

    dfs(1);
    cout << b[1] << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int TC = 1;

    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }


    while(TC--)
    {
        solve();
        cout << endl;
    }

    return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:120:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp:121:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 39004 KB Output is correct
2 Correct 8 ms 39004 KB Output is correct
3 Correct 8 ms 39216 KB Output is correct
4 Correct 10 ms 39004 KB Output is correct
5 Correct 10 ms 39004 KB Output is correct
6 Correct 8 ms 39004 KB Output is correct
7 Correct 8 ms 38996 KB Output is correct
8 Correct 8 ms 39000 KB Output is correct
9 Correct 8 ms 39004 KB Output is correct
10 Correct 8 ms 39004 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 39004 KB Output is correct
2 Correct 9 ms 39004 KB Output is correct
3 Correct 8 ms 39004 KB Output is correct
4 Correct 8 ms 39172 KB Output is correct
5 Correct 8 ms 39256 KB Output is correct
6 Correct 8 ms 39004 KB Output is correct
7 Correct 8 ms 39012 KB Output is correct
8 Correct 9 ms 39272 KB Output is correct
9 Correct 8 ms 39016 KB Output is correct
10 Correct 8 ms 39012 KB Output is correct
11 Correct 8 ms 39024 KB Output is correct
12 Correct 10 ms 39012 KB Output is correct
13 Correct 9 ms 39072 KB Output is correct
14 Correct 9 ms 39012 KB Output is correct
15 Correct 9 ms 39016 KB Output is correct
16 Correct 9 ms 39008 KB Output is correct
17 Correct 9 ms 39012 KB Output is correct
18 Correct 8 ms 39008 KB Output is correct
19 Correct 13 ms 39244 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 39004 KB Output is correct
2 Correct 8 ms 39004 KB Output is correct
3 Correct 8 ms 39216 KB Output is correct
4 Correct 10 ms 39004 KB Output is correct
5 Correct 10 ms 39004 KB Output is correct
6 Correct 8 ms 39004 KB Output is correct
7 Correct 8 ms 38996 KB Output is correct
8 Correct 8 ms 39000 KB Output is correct
9 Correct 8 ms 39004 KB Output is correct
10 Correct 8 ms 39004 KB Output is correct
11 Correct 8 ms 39004 KB Output is correct
12 Correct 9 ms 39004 KB Output is correct
13 Correct 8 ms 39004 KB Output is correct
14 Correct 8 ms 39172 KB Output is correct
15 Correct 8 ms 39256 KB Output is correct
16 Correct 8 ms 39004 KB Output is correct
17 Correct 8 ms 39012 KB Output is correct
18 Correct 9 ms 39272 KB Output is correct
19 Correct 8 ms 39016 KB Output is correct
20 Correct 8 ms 39012 KB Output is correct
21 Correct 8 ms 39024 KB Output is correct
22 Correct 10 ms 39012 KB Output is correct
23 Correct 9 ms 39072 KB Output is correct
24 Correct 9 ms 39012 KB Output is correct
25 Correct 9 ms 39016 KB Output is correct
26 Correct 9 ms 39008 KB Output is correct
27 Correct 9 ms 39012 KB Output is correct
28 Correct 8 ms 39008 KB Output is correct
29 Correct 13 ms 39244 KB Output is correct
30 Incorrect 10 ms 39112 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 39004 KB Output is correct
2 Correct 8 ms 39004 KB Output is correct
3 Correct 8 ms 39216 KB Output is correct
4 Correct 10 ms 39004 KB Output is correct
5 Correct 10 ms 39004 KB Output is correct
6 Correct 8 ms 39004 KB Output is correct
7 Correct 8 ms 38996 KB Output is correct
8 Correct 8 ms 39000 KB Output is correct
9 Correct 8 ms 39004 KB Output is correct
10 Correct 8 ms 39004 KB Output is correct
11 Correct 8 ms 39004 KB Output is correct
12 Correct 9 ms 39004 KB Output is correct
13 Correct 8 ms 39004 KB Output is correct
14 Correct 8 ms 39172 KB Output is correct
15 Correct 8 ms 39256 KB Output is correct
16 Correct 8 ms 39004 KB Output is correct
17 Correct 8 ms 39012 KB Output is correct
18 Correct 9 ms 39272 KB Output is correct
19 Correct 8 ms 39016 KB Output is correct
20 Correct 8 ms 39012 KB Output is correct
21 Correct 8 ms 39024 KB Output is correct
22 Correct 10 ms 39012 KB Output is correct
23 Correct 9 ms 39072 KB Output is correct
24 Correct 9 ms 39012 KB Output is correct
25 Correct 9 ms 39016 KB Output is correct
26 Correct 9 ms 39008 KB Output is correct
27 Correct 9 ms 39012 KB Output is correct
28 Correct 8 ms 39008 KB Output is correct
29 Correct 13 ms 39244 KB Output is correct
30 Incorrect 10 ms 39112 KB Output isn't correct
31 Halted 0 ms 0 KB -