제출 #1047077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047077		Abito	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2094 ms	27084 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=2e5+5;
int a[N],c[N],p[N],n,f[505];
vector<int> adj[N],s;
void dfs(int x){
    s.pb(x);
    for (auto u:adj[x]) dfs(u);
    return;
}
int check(int x){
    dfs(x);
    if (s.size()==1){
        s.clear();
        return 1;
    }
    sort(s.begin(),s.end());
    //cout<<x<<endl;
    //for (auto u:s) cout<<u<<' ';cout<<endl;
    bool ok=0;
    do{
        if (s[0]!=x) continue;
        bool h=1;
        for (int i=1;i<s.size();i++){
            if (f[c[s[i]]]>=s.size()){
                h=0;
                break;
            }
            if (s[f[c[s[i]]]]==p[s[i]]){
                f[c[s[i]]]++;
                continue;
            }
            h=0;
            break;
        }
        ok|=h;
        memset(f,0,sizeof(f));
    }while (next_permutation(s.begin(),s.end()));
    s.clear();
    return ok;
}
vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    n=N;
    vector<int> ans(n,0);
    for (int i=0;i<n;i++) p[i]=P[i],c[i]=C[i];
    for (int i=1;i<n;i++) adj[p[i]].pb(i);
    for (int i=0;i<n;i++) ans[i]=check(i);
    return ans;
}

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

beechtree.cpp: In function 'int check(int)':
beechtree.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i=1;i<s.size();i++){
      |                      ~^~~~~~~~~
beechtree.cpp:27:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             if (f[c[s[i]]]>=s.size()){
      |                 ~~~~~~~~~~^~~~~~~~~~

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