oj.uz

답안 #478749

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
478749 2021-10-08T08:42:16 Z stefantaga Arboras (RMI20_arboras) C++14
24 / 100
 5000 ms 9576 KB 
#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;
pair <int,int> ceau[100005];
long long val[100005],cost[100005],lung[100005];
void haide(int poz)
{
    val[poz]=lung[ceau[poz].first]+cost[ceau[poz].first]+lung[ceau[poz].second]+cost[ceau[poz].second];
}
long long sum,inainte;
void updateaza(int poz,int nod)
{
    if (ceau[poz].first==nod)
    {
        inainte=val[poz];
        haide(poz);
        sum=(sum+(val[poz]%MOD)-(inainte%MOD)+MOD)%MOD;
    }
    else
    if (ceau[poz].second==nod)
    {
        if (lung[nod]+cost[nod]>lung[ceau[poz].first]+cost[ceau[poz].first])
        {
            ceau[poz].second=ceau[poz].first;
            ceau[poz].first=nod;
        }
        inainte=val[poz];
        haide(poz);
        sum=(sum+(val[poz]%MOD)-(inainte%MOD)+MOD)%MOD;
    }
    else
    {
        if (lung[nod]+cost[nod]>lung[ceau[poz].first]+cost[ceau[poz].first])
        {
            ceau[poz].second=ceau[poz].first;
            ceau[poz].first=nod;
        }
        else
        {
            if (lung[nod]+cost[nod]>lung[ceau[poz].second]+cost[ceau[poz].second])
            {
                ceau[poz].second=nod;
            }
        }
        inainte=val[poz];
        haide(poz);
        sum=(sum+(val[poz]%MOD)-(inainte%MOD)+MOD)%MOD;
    }
    lung[poz]=max(lung[poz],lung[nod]+cost[nod]);
}
vector <int> v[100005];
int loc;
void dfs(int x)
{
    for (int i=0;i<v[x].size();i++)
    {
        dfs(v[x][i]);
        loc=v[x][i];
        updateaza(x,loc);
    }
}
int n,i,tata[100005];
int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n;
    for (i=2;i<=n;i++)
    {
        cin>>tata[i];
        tata[i]++;
        v[tata[i]].push_back(i);
    }
    for (i=2;i<=n;i++)
    {
        cin>>cost[i];
    }
    dfs(1);
    cout<<sum<<'\n';
    int q,x,y;
    cin>>q;
    for (i=1;i<=q;i++)
    {
        cin>>x>>y;
        x++;
        cost[x]+=y;
        while (x!=1)
        {
            updateaza(tata[x],x);
            x=tata[x];
        }
        cout<<sum<<'\n';
    }
    return 0;
}

Compilation message

arboras.cpp: In function 'void dfs(int)':
arboras.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i=0;i<v[x].size();i++)
      |                  ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2636 KB Output is correct
2 Correct 8 ms 2768 KB Output is correct
3 Correct 4 ms 2640 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 8772 KB Output is correct
2 Correct 144 ms 6976 KB Output is correct
3 Correct 87 ms 7112 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5043 ms 9576 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2636 KB Output is correct
2 Correct 8 ms 2768 KB Output is correct
3 Correct 4 ms 2640 KB Output is correct
4 Correct 110 ms 8772 KB Output is correct
5 Correct 144 ms 6976 KB Output is correct
6 Correct 87 ms 7112 KB Output is correct
7 Execution timed out 5043 ms 9576 KB Time limit exceeded
8 Halted 0 ms 0 KB -