oj.uz

답안 #834035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834035 2023-08-22T10:17:27 Z NemanjaSo2005 Magic Tree (CEOI19_magictree) C++17
47 / 100
 1533 ms 1048576 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
map<int,ll> update[100005];
vector<int> stablo[100005],Brisi;
int N,M,K,rod[100005],vred[100005],kad[100005];
void dfs(int gde){
   if(stablo[gde].size()==0){
      if(kad[gde]==-1)
         return;
      update[gde][kad[gde]]=vred[gde];
      return;
   }
   for(int i=0;i<stablo[gde].size();i++)
      dfs(stablo[gde][i]);
   int najv=0;
   for(int i=1;i<stablo[gde].size();i++)
      if(update[stablo[gde][i]].size()>update[najv].size())
         najv=stablo[gde][i];
   swap(update[gde],update[najv]);
   for(int i=0;i<stablo[gde].size();i++){
      if(stablo[gde][i]==najv)
         continue;
      int koji=stablo[gde][i];
      for(auto it=update[koji].begin();it!=update[koji].end();it++)
         update[gde][it->first]+=it->second;
   }
   if(kad[gde]!=-1){
      update[gde][kad[gde]]+=vred[gde];
      auto it=update[gde].upper_bound(kad[gde]);
      ll vel=vred[gde];
      Brisi.clear();
      for(it;it!=update[gde].end();it++){
         if(it->second<=vel){
            vel-=it->second;
            Brisi.push_back(it->first);
         }
         else{
            it->second-=vel;
            break;
         }
      }
      for(int i=0;i<Brisi.size();i++)
         update[gde].erase(Brisi[i]);
   }
   return;
}
int main(){
   cin>>N>>M>>K;
   for(int i=2;i<=N;i++){
      cin>>rod[i];
      stablo[rod[i]].push_back(i);
   }
   for(int i=1;i<=N;i++)
      kad[i]=-1;
   int a;
   for(int i=1;i<=M;i++){
      cin>>a;
      cin>>kad[a]>>vred[a];
   }
   dfs(1);
   ll res=0;
   for(auto it=update[1].begin();it!=update[1].end();it++)
      res+=it->second;
   cout<<res<<"\n";
   return 0;
}

Compilation message

magictree.cpp: In function 'void dfs(int)':
magictree.cpp:14:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |    for(int i=0;i<stablo[gde].size();i++)
      |                ~^~~~~~~~~~~~~~~~~~~
magictree.cpp:17:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |    for(int i=1;i<stablo[gde].size();i++)
      |                ~^~~~~~~~~~~~~~~~~~~
magictree.cpp:21:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |    for(int i=0;i<stablo[gde].size();i++){
      |                ~^~~~~~~~~~~~~~~~~~~
magictree.cpp:33:11: warning: statement has no effect [-Wunused-value]
   33 |       for(it;it!=update[gde].end();it++){
      |           ^~
magictree.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |       for(int i=0;i<Brisi.size();i++)
      |                   ~^~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7356 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7272 KB Output is correct
5 Correct 3 ms 7356 KB Output is correct
6 Correct 3 ms 7324 KB Output is correct
7 Correct 3 ms 7252 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 22876 KB Output is correct
2 Runtime error 1345 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7636 KB Output is correct
2 Correct 6 ms 9020 KB Output is correct
3 Correct 24 ms 19880 KB Output is correct
4 Correct 133 ms 58440 KB Output is correct
5 Runtime error 1533 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 15964 KB Output is correct
2 Correct 115 ms 14580 KB Output is correct
3 Correct 100 ms 26316 KB Output is correct
4 Correct 81 ms 14660 KB Output is correct
5 Correct 107 ms 36724 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7356 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7272 KB Output is correct
5 Correct 3 ms 7356 KB Output is correct
6 Correct 3 ms 7324 KB Output is correct
7 Correct 3 ms 7252 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct
10 Correct 105 ms 20820 KB Output is correct
11 Correct 100 ms 19148 KB Output is correct
12 Correct 233 ms 113372 KB Output is correct
13 Correct 61 ms 14604 KB Output is correct
14 Correct 253 ms 142088 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 8244 KB Output is correct
2 Correct 43 ms 10572 KB Output is correct
3 Correct 35 ms 10568 KB Output is correct
4 Correct 40 ms 10736 KB Output is correct
5 Correct 17 ms 9156 KB Output is correct
6 Correct 484 ms 271124 KB Output is correct
7 Correct 484 ms 301448 KB Output is correct

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7356 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7272 KB Output is correct
5 Correct 3 ms 7356 KB Output is correct
6 Correct 3 ms 7324 KB Output is correct
7 Correct 3 ms 7252 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct
10 Correct 4 ms 7636 KB Output is correct
11 Correct 6 ms 9020 KB Output is correct
12 Correct 24 ms 19880 KB Output is correct
13 Correct 133 ms 58440 KB Output is correct
14 Runtime error 1533 ms 1048576 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7356 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7272 KB Output is correct
5 Correct 3 ms 7356 KB Output is correct
6 Correct 3 ms 7324 KB Output is correct
7 Correct 3 ms 7252 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct
10 Correct 84 ms 22876 KB Output is correct
11 Runtime error 1345 ms 1048576 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -