제출 #1271154

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1271154		BigBadBully	9월 (APIO24_september)	C++20	45 / 100	548 ms	14936 KiB

september

#include "september.h"

#include <bits/stdc++.h>
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;

pii p = {109,59};
pii mod = {1e9+7,1e9+9};

int exp(int x,int a,int mod)
{
    int ans = 1;
    for (;a>0;a/=2,x=x*x%mod)
        if(a%2) ans=ans*x%mod;
    return ans;
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	
    int n=N,m=M;
    auto par = F;
    auto s = S;
    vector<int> del(n,0);
    vector<vector<int>> graph(n);
    for (int i = 1; i < n; i++)
        graph[par[i]].push_back(i);
    
    int cnt = 0;
    function<void(int)> dfs = [&](int cur)
    {
        if (del[cur])return;
        cnt++;
        del[cur]  =1;
        for(int a : graph[cur])
            dfs(a);
    };
    vector<pii> hash(m);
    map<pii,int> here;
    here[{0,0}] = m;
    int ans = 0;
    for (int i = 0; i < n-1; i++)
    {
        dfs(s[0][i]);
        for (int j = 0; j < m; j++)
        {
            here[hash[j]]--;
            hash[j].ff+=exp(p.ff,s[j][i],mod.ff);
            hash[j].ff%=mod.ff;
            hash[j].ss+=exp(p.ss,s[j][i],mod.ss);
            hash[j].ss%=mod.ss;
            here[hash[j]]++;
        }
        if(here[hash[0]]==m && cnt==i+1)
            ans++;
    }
    return ans;
}

• 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: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16