oj.uz

Submission #498046

# Submission time Handle Problem Language Result Execution time Memory
498046 2021-12-24T10:06:50 Z andrei_boaca Magic Tree (CEOI19_magictree) C++17
100 / 100
 1199 ms 17228 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
typedef long long ll;
ll n,m,k,par[100005],niv[100005],dp[3][100005],val[100005],day[100005],minim[100005];
vector<int> muchii[100005];
struct date
{
    ll nod,day,val;
} v[100005];
void dfscontrol(int nod)
{
    if(nod==1)
        niv[nod]=1;
    for(int i=0;i<muchii[nod].size();i++)
    {
        int fiu=muchii[nod][i];
        par[fiu]=nod;
        niv[fiu]=niv[nod]+1;
        dfscontrol(fiu);
    }
}
bool comp(date a, date b)
{
    if(a.day!=b.day)
        return a.day<b.day;
    if(niv[a.nod]!=niv[b.nod])
        return niv[a.nod]>niv[b.nod];
    return 0;
}
bool comp1(date a, date b)
{
    return a.nod>b.nod;
}
void solve3()
{
    sort(v+1,v+m+1,comp1);
    for(int i=1;i<=1e5;i++)
        minim[i]=1e9;
    int ans=0;
    for(int i=1;i<=m;i++)
    {
        int val=v[i].day;
        int st=0;
        int dr=i-1;
        int best=0;
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            if(minim[mij]<=val)
            {
                best=mij;
                st=mij+1;
            }
            else
                dr=mij-1;
        }
        ans=max(ans,best+1);
        minim[best+1]=min(minim[best+1],val*1LL);
    }
    cout<<ans<<'\n';
}
void dfs(int nod)
{
    for(int i=0;i<muchii[nod].size();i++)
    {
        int fiu=muchii[nod][i];
        dfs(fiu);
    }
    if(val[nod]!=0&&day[nod]!=0)
        for(int i=day[nod];i<=day[nod];i++)
            dp[i][nod]+=val[nod];
    for(int i=0;i<muchii[nod].size();i++)
    {
        int fiu=muchii[nod][i];
        for(int j=1;j<=k;j++)
            dp[j][nod]+=dp[j][fiu];
    }
    dp[2][nod]=max(dp[1][nod],dp[2][nod]);
}
void solve4()
{
    for(int i=1;i<=m;i++)
    {
        int nod=v[i].nod;
        day[nod]=v[i].day;
        val[nod]=v[i].val;
    }
    dfs(1);
    cout<<max(dp[1][1],dp[k][1])<<'\n';
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>k;
    bool is3=1;
    for(int i=2;i<=n;i++)
    {
        int p;
        cin>>p;
        par[i]=p;
        if(par[i]!=i-1)
            is3=0;
        muchii[p].push_back(i);
    }
    for(int i=1;i<=m;i++)
        cin>>v[i].nod>>v[i].day>>v[i].val;
    dfscontrol(1);
    sort(v+1,v+m+1,comp);
    if(k<=2)
    {
        solve4();
        return 0;
    }
    if(is3)
    {
        solve3();
        return 0;
    }
    for(int i=1;i<=m;i++)
    {
        int nod=v[i].nod;
        ll x=v[i].val;
        dp[1][nod]=dp[0][nod]+x;
        while(nod!=1)
        {
            nod=par[nod];
            dp[0][nod]+=x;
            if(dp[0][nod]-x<=dp[1][nod]&&dp[0][nod]>dp[1][nod])
                x=dp[0][nod]-dp[1][nod];
            else if(dp[0][nod]<=dp[1][nod])
            {
                x=0;
                break;
            }
        }
    }
    cout<<dp[0][1];
    return 0;
}

Compilation message

magictree.cpp: In function 'void dfscontrol(int)':
magictree.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=0;i<muchii[nod].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~
magictree.cpp: In function 'void dfs(int)':
magictree.cpp:65:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0;i<muchii[nod].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~
magictree.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<muchii[nod].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7792 KB Output is correct
2 Correct 1052 ms 9028 KB Output is correct
3 Correct 60 ms 8564 KB Output is correct
4 Correct 44 ms 7616 KB Output is correct
5 Correct 1199 ms 8324 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3532 KB Output is correct
2 Correct 2 ms 3532 KB Output is correct
3 Correct 2 ms 3532 KB Output is correct
4 Correct 49 ms 13056 KB Output is correct
5 Correct 47 ms 13084 KB Output is correct
6 Correct 68 ms 13080 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 11080 KB Output is correct
2 Correct 66 ms 11032 KB Output is correct
3 Correct 60 ms 13800 KB Output is correct
4 Correct 39 ms 9920 KB Output is correct
5 Correct 52 ms 17228 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 102 ms 9488 KB Output is correct
11 Correct 58 ms 9424 KB Output is correct
12 Correct 720 ms 11332 KB Output is correct
13 Correct 37 ms 7656 KB Output is correct
14 Correct 72 ms 12836 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3660 KB Output is correct
2 Correct 25 ms 7244 KB Output is correct
3 Correct 25 ms 7244 KB Output is correct
4 Correct 29 ms 7292 KB Output is correct
5 Correct 13 ms 5556 KB Output is correct
6 Correct 42 ms 7664 KB Output is correct
7 Correct 32 ms 9272 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 3 ms 3532 KB Output is correct
11 Correct 2 ms 3532 KB Output is correct
12 Correct 2 ms 3532 KB Output is correct
13 Correct 49 ms 13056 KB Output is correct
14 Correct 47 ms 13084 KB Output is correct
15 Correct 68 ms 13080 KB Output is correct
16 Correct 102 ms 9488 KB Output is correct
17 Correct 58 ms 9424 KB Output is correct
18 Correct 720 ms 11332 KB Output is correct
19 Correct 37 ms 7656 KB Output is correct
20 Correct 72 ms 12836 KB Output is correct
21 Correct 13 ms 4044 KB Output is correct
22 Correct 45 ms 8524 KB Output is correct
23 Correct 42 ms 8464 KB Output is correct
24 Correct 59 ms 9516 KB Output is correct
25 Correct 41 ms 7640 KB Output is correct
26 Correct 881 ms 9780 KB Output is correct
27 Correct 615 ms 11456 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 1 ms 2636 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 1 ms 2636 KB Output is correct
10 Correct 35 ms 7792 KB Output is correct
11 Correct 1052 ms 9028 KB Output is correct
12 Correct 60 ms 8564 KB Output is correct
13 Correct 44 ms 7616 KB Output is correct
14 Correct 1199 ms 8324 KB Output is correct
15 Correct 3 ms 3532 KB Output is correct
16 Correct 2 ms 3532 KB Output is correct
17 Correct 2 ms 3532 KB Output is correct
18 Correct 49 ms 13056 KB Output is correct
19 Correct 47 ms 13084 KB Output is correct
20 Correct 68 ms 13080 KB Output is correct
21 Correct 65 ms 11080 KB Output is correct
22 Correct 66 ms 11032 KB Output is correct
23 Correct 60 ms 13800 KB Output is correct
24 Correct 39 ms 9920 KB Output is correct
25 Correct 52 ms 17228 KB Output is correct
26 Correct 102 ms 9488 KB Output is correct
27 Correct 58 ms 9424 KB Output is correct
28 Correct 720 ms 11332 KB Output is correct
29 Correct 37 ms 7656 KB Output is correct
30 Correct 72 ms 12836 KB Output is correct
31 Correct 6 ms 3660 KB Output is correct
32 Correct 25 ms 7244 KB Output is correct
33 Correct 25 ms 7244 KB Output is correct
34 Correct 29 ms 7292 KB Output is correct
35 Correct 13 ms 5556 KB Output is correct
36 Correct 42 ms 7664 KB Output is correct
37 Correct 32 ms 9272 KB Output is correct
38 Correct 13 ms 4044 KB Output is correct
39 Correct 45 ms 8524 KB Output is correct
40 Correct 42 ms 8464 KB Output is correct
41 Correct 59 ms 9516 KB Output is correct
42 Correct 41 ms 7640 KB Output is correct
43 Correct 881 ms 9780 KB Output is correct
44 Correct 615 ms 11456 KB Output is correct
45 Correct 17 ms 4376 KB Output is correct
46 Correct 55 ms 9928 KB Output is correct
47 Correct 50 ms 9996 KB Output is correct
48 Correct 74 ms 11984 KB Output is correct
49 Correct 45 ms 9744 KB Output is correct
50 Correct 963 ms 12236 KB Output is correct
51 Correct 651 ms 13928 KB Output is correct