Submission #1184359

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184359		HADI_T	September (APIO24_september)	C++20	0 / 100	2 ms	2884 KiB

september

#include "september.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
const int N = 1e5+10;
using namespace std;
vector<int>adj[N];
bool vis[N];
set<int>st;
void dfs(int node,int parent)
{
    //cout<<node<<endl;
    if(vis[node])
        return ;
        vis[node] = 1;
    for(auto it:adj[node])
    {
        if(it == parent)
            continue;
        st.insert(it);
        dfs(it , node);
    }
}
int solve(int n, int m, std::vector<int> f, std::vector<std::vector<int>> s) {
    int ans = INT_MAX;
    for(int i=1;i<n;i++)
    {
        adj[i].pb(f[i]);
        adj[f[i]].pb(i);
    }
    for(int i=0;i<m;i++)
    {
        int cur = 0;
        for(int j=0;j<n;j++)
        vis[j] = 0;
        st.clear();
        for(int j=0;j<s[i].size();j++)
        {
            if(st.find(s[i][j]) != st.end())
            {
                st.erase(st.find(s[i][j]));
                continue;
            }
            if(st.empty())
                cur++;
            dfs(s[i][j],f[s[i][j]]);

        }
        ans = min(ans , cur);
    }
    for(int i=0;i<n;i++)
    {
        adj[i].clear();
        vis[i] = 0;
    }
    st.clear();
	return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 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