oj.uz

Submission #951536

# Submission time Handle Problem Language Result Execution time Memory
951536 2024-03-22T05:19:05 Z Faisal_Saqib Bosses (BOI16_bosses) C++17
100 / 100
 958 ms 1104 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=5e3+1;
vector<int> tp[N],ma[N];
int val[N];
bitset<5001> vis;
int compute_answer(int&v)
{
    val[v]=0;
    int oth=0;
    for(int&ap:ma[v])
    {
        oth+=compute_answer(ap);
        val[v]+=val[ap];
    }
    val[v]++;
    return val[v]+oth;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        for(int j=1;j<=k;j++)
        {
            int p;
            cin>>p;
            tp[p].push_back(i);
        }
    }
    int ans=1e9;
    int vp=0;
    queue<int> q;
    for(int i=1;i<=n;i++)
    {
        // vis.clear();
        vis.reset();
        vp=0;
        {
            //Time = O()
            q.push(i);
            vis[i]=1;
            ma[i].clear();
            while(q.size())
            {
                int f=q.front();
                vp++;
                q.pop();
                for(int&ap:tp[f])
                {
                    if(!vis[ap])
                    {
                        vis[ap]=1;
                        ma[ap].clear();
                        ma[f].push_back(ap);
                        q.push(ap);
                    }
                }
            }
        }
        if(vp!=n)
            continue;
        ans=min(ans,compute_answer(i));
    }
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 600 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 684 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 684 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 102 ms 964 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 565 ms 1104 KB Output is correct
17 Correct 958 ms 1012 KB Output is correct
18 Correct 915 ms 1040 KB Output is correct