제출 #1031577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1031577		aaaaaarroz	참나무 (IOI23_beechtree)	C++17	58 / 100	2050 ms	64852 KiB

beechtree

#include <bits/stdc++.h>
#include "beechtree.h"
using namespace std;
const int MN=2e5+5;
int n, m;
vector<int> v[MN], p, c, ans;
int a[MN], b[MN];
void dfs(int xd=0){
    b[xd]=1;
    for (int &u: v[xd]){
        dfs(u);
        b[xd]+=b[u];
    }
    priority_queue<tuple<int, int, int>> q;
    q.push({b[xd],0,xd});
    vector<int> V;
    for(int i=0;i<=m;i++){
		a[i]=0;
	}
    while(!q.empty()){
        auto x=get<2>(q.top()); 
		q.pop(); 
        if (x!=xd) {
            if(a[c[x]]>=V.size() || V[a[c[x]]]!=p[x]){
				return;
			}
            a[c[x]]++;
        } 
        V.push_back(x);
        for(int u:v[x]){
			q.push({b[u], -V.size(), u});
		}
    }
    ans[xd]=1;
    return;
}
vector<int> beechtree(int N, int M, vector<int> P, vector<int> C){
    n=N;
	m=M; 
	p=P; 
	c=C;
	ans.resize(n,0);  
    for(int i=1;i<n;i++){
		v[p[i]].push_back(i);
	}
    dfs();
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

beechtree.cpp: In function 'void dfs(int)':
beechtree.cpp:24:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             if(a[c[x]]>=V.size() || V[a[c[x]]]!=p[x]){
      |                ~~~~~~~^~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 0 / 5
• Subtask 3: 9 / 9
• Subtask 4: 0 / 8
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 12 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12