제출 #980919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980919		vjudge1	참나무 (IOI23_beechtree)	C++17	9 / 100	2094 ms	16332 KiB

beechtree

#include "beechtree.h"
using namespace std;
#define pb push_back
#include<bits/stdc++.h>
#define deb(x) cout<<#x<<": "<<x<<endl;
bool DFS (int N, vector<vector<int>> &sons,vector<int> &P, vector<int> &C){
    if(sons[N].size()==0) return true;
    vector<int> st;
    st.pb(N);
    queue<int> q;
    for(int x: sons[N]){
        q.push(x);
    }
    while(!q.empty()){
        int x=q.front();
        q.pop();
        st.pb(x);
        for(int a:sons[x]){
            q.push(a);
        }
    }

    sort(st.begin(), st.end());
    do{
   
        vector<int> colors;
        //colors.pb(C[st[0]]);
        bool works=true;
        for(int i=1; i<st.size(); ++i){ 
            int cont=0;
            for(int x: colors){
                if(x==C[st[i]]){
                    cont++;
                }
            }
            if(st[cont]!=P[st[i]]){
                works=false;
                break;
            }
            colors.pb(C[st[i]]);
        }
        if(works){
            return true;
        }
    }while(next_permutation(st.begin()+1, st.end()));
    return false;

}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    vector<int> ans (N,0);
    vector<vector<int>> sons (N);
    for(int i=1;i<N; ++i){
        sons[P[i]].pb(i);
    }
    for(int i=0; i<N; ++i){
        if(DFS(i, sons, P, C)){
            ans[i]=1;
        }
    }
    return ans;




    return {};
}

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

beechtree.cpp: In function 'bool DFS(int, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&)':
beechtree.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int i=1; i<st.size(); ++i){
      |                      ~^~~~~~~~~~

• 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