Submission #1103658

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103658		Ahmed57	Tree (IOI24_tree)	C++17	7 / 100	57 ms	8488 KiB

tree

#include <bits/stdc++.h>
using namespace std;
long long cnt = 0;
bool nah = 0;
void init(std::vector<int> P, std::vector<int> W){
    int deg[P.size()] = {0};
    if(P.size()==1){
        nah = 1;
    }
    int root = -1;
    for(int i = 0;i<P.size();i++){
        int x = P[i];
        if(x==-1){
            root = i;
        }else{
            deg[x]++;
            deg[i]++;
        }
    }
    for(int i = 0;i<P.size();i++){
        if(i==root)continue;
        if(deg[i]==1)cnt++;
    }
}
long long query(int L, int R){
    if(nah)return L;
    return cnt*L+max(0ll,(cnt*L-R));
}

Compilation message (stderr)

tree.cpp: In function 'void init(std::vector<int>, std::vector<int>)':
tree.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i = 0;i<P.size();i++){
      |                   ~^~~~~~~~~
tree.cpp:20:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 0;i<P.size();i++){
      |                   ~^~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 7 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19