제출 #1202431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202431		ElayV13	9월 (APIO24_september)	C++20	25 / 100	1093 ms	3144 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 1;;
const int INF = INT_MAX;

vector < int > adj[N];
int idx[N] , sub[N];
int cur_idx = 0;

void dfs(int v , int p)
{
        sub[v] = 1;
        idx[v] = ++cur_idx;
        for(int u : adj[v])
        {
                if(u != p)
                {
                        dfs(u , v);
                        sub[v] += sub[u];
                }
        }
}

bool is_anc(int u , int v)
{
        if(idx[v] >= idx[u] && idx[u] + sub[u] - 1 >= idx[v]) return true;
        return false;
}

void fix(int n)
{
        for(int i = 0;i <= n;i++) adj[i].clear() , idx[i] = 0 , sub[i] = 0;
        cur_idx = 0;
}

int solve(int n , int m , vector < int > F , vector < vector < int > > S)
{
        for(int i = 1;i <= n - 1;i++)
        {
                adj[i].push_back(F[i]);
                adj[F[i]].push_back(i);
        }
        dfs(0 , -1);
        int res = 1;
        vector < vector < int > > curv(m);
        for(int i = 0;i < S[0].size() - 1;i++)
        {
                for(int j = 0;j < m;j++) curv[j].push_back(S[j][i]);
                set < vector < int > > st;
                for(int j = 0;j < m;j++) st.insert(curv[j]);
                if(st.size() != 1) continue;
                bool can = 1;
                for(int j = 0;j < m;j++)
                {
                        for(int fi = 0;fi <= i;fi++)
                        {
                                for(int si = i + 1;si < S[0].size();si++)
                                {
                                        if(is_anc(S[j][fi] , S[j][si])) can = 0;
                                }
                        }
                }
                if(can) for(int j = 0;j < m;j++) curv[j].clear();
                res += can;
        }
        fix(n);
        return res;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16