oj.uz

Submission #885527

# Submission time Handle Problem Language Result Execution time Memory
885527 2023-12-10T01:52:04 Z cpptowin Bosses (BOI16_bosses) C++17
0 / 100
 23 ms 63080 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf (int)1e18
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n;
vi ke[maxn];
vi adj[maxn];
int sz[maxn],vis[maxn];
int dfs(int u)
{
    vis[u] = 1;
    int ans = 0;
    sz[u] = 1;
    for(int v : ke[u]) if(vis[v] == 0)
    {
        ans += dfs(v);
        sz[u] += sz[v];
    }
    return ans + sz[u];
}
int bfs(int inp)
{
    memset(sz,0,sizeof sz);
    fo(i,1,n) adj[i].clear();
    memset(vis,0,sizeof vis);
    queue<int> q;
    q.push(inp);
    vis[inp] = 1;
    int cnt = 0;
    while(q.size())
    {
        int u = q.front();
        q.pop();
        for(int v : ke[u])
        {
            if(!vis[v])
            {
                vis[v] = 1;
                cnt++;
                adj[u].pb(v);
                q.push(v);
            }
        }
    }
    memset(vis,0,sizeof vis);
    return cnt;
}
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n;
    fo(i,1,n)
    {
        int k;
        cin >> k;
        fo(_,1,k)
        {
            int x;
            cin >> x;
            ke[x].pb(i);
        }
    }
    int ans = inf;
    fo(i,1,n) if(bfs(i) == n - 1)
    {
//        fo(j,1,n)
//        {
//            for(int it : adj[j]) cout << j <<  ' ' << it << "\n";
//        }
//        cout << i << "\n";
        ans = min(ans,dfs(i));
    }
    cout << ans;
}

Compilation message

bosses.cpp:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   65 | main()
      | ^~~~
bosses.cpp: In function 'int main()':
bosses.cpp:70:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:71:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 63064 KB Output is correct
2 Incorrect 19 ms 63080 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 63064 KB Output is correct
2 Incorrect 19 ms 63080 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 63064 KB Output is correct
2 Incorrect 19 ms 63080 KB Output isn't correct
3 Halted 0 ms 0 KB -