제출 #949946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
949946		vjudge306	Bosses (BOI16_bosses)	C++17	67 / 100	1507 ms	1316 KiB

bosses

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define nn "\n"
#define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define intt int _; cin >> _; while (_--)
#define emp push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ld long double
#define A first
#define B second
//#define int long long
typedef long long ll;
const ld eps = 1e-27;
// diff between decimals 0.000000001 mt19937 mt(time(nullptr));
ll sm=0;
ll dfs(int i, int p, vector<int>adj[]) {
ll x=0;
for (auto j:adj[i]) {
    if (p!=j) x+=dfs(j,i,adj);
}
sm+=x+1;
return x+1;
}

ll fun(int root, int n, vector<int>ch[]) {
queue<int>v1, v2; v1.push(root); int v[n+2]={}; vector<int>adj[n+2]; --n; v[root]=1;

while ((!v1.empty()||!v2.empty())) {
        if (!n)break;
    if (!v1.empty()) {
       while (!v1.empty()) {
        int x=v1.front(); v1.pop();
        for (auto i:ch[x])
            if (!v[i]) adj[x].emp(i), v[i]=1, v2.push(i),n--;
       }
    }
    else {
        while (!v2.empty()) {
        int x=v2.front(); v2.pop();
        for (auto i:ch[x])
            if (!v[i]) adj[x].emp(i), v[i]=1, v1.push(i),n--;
       }
    }
}
if (n) return LLONG_MAX;
 sm=0; ll x=dfs(root, root, adj);
return sm;
}
int main() {

    x_x
    int n; cin>>n; vector<int>ch[n+2];
    for (int i=1,k,c; i<=n; i++) {
        cin>>k; while(k--) cin>>c, ch[c].emp(i);
    }
    ll ans=LLONG_MAX;
    for (int i=1; i<=n; i++)
        ans=min(ans, fun(i,n,ch));

    cout<<ans;
  return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bosses.cpp: In function 'll fun(int, int, std::vector<int>*)':
bosses.cpp:51:11: warning: unused variable 'x' [-Wunused-variable]
   51 |  sm=0; ll x=dfs(root, root, adj);
      |           ^

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 0 / 33