제출 #928757

#제출 시각아이디문제언어결과실행 시간메모리
928757BaizhoBosses (BOI16_bosses)C++14
0 / 100
3 ms12384 KiB
#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<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #pragma GCC optimize("Ofast,unroll-loops,fast-math") #pragma GCC target("popcnt") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(1e5)+5; const int M = ll(2e5) + 5; const long long inf = 1e18; const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } int n, siz[N]; vector<int> final[N]; set<int> g[N], boss[N]; void dfs(int v, int p = -1) { if(siz[v]) return; siz[v] = 1; for(auto to : final[v]) { dfs(to, v); siz[v] += siz[to]; } } void Baizho() { cin>>n; for(int i = 1; i <= n; i ++) { int k; cin>>k; while(k --) { int b; cin>>b; g[b].insert(i); boss[i].insert(b); } } set<pair<int, int> > st; for(int i = 1; i <= n; i ++) { st.insert({g[i].size(), i}); } while(!st.empty()) { int v = (*st.rbegin()).ss; // cout<<v<<endl; st.erase(--st.end()); for(auto x : boss[v]) { st.erase({g[x].size(), x}); if(g[x].size() > 1) st.insert({g[x].size() - 1, x}); g[x].erase(v); } for(auto to : g[v]) { final[v].pb(to); // cout<<"to "<<v<<" "<<to<<" "<<g[v].size()<<endl; for(auto x : boss[to]) { if(x == v) continue; st.erase({g[x].size(), x}); if(g[x].size() > 1) st.insert({g[x].size() - 1, x}); g[x].erase(to); } } g[v].clear(); boss[v].clear(); } for(int i = 1; i <= n; i ++) dfs(i); long long ans = 0; for(int i = 1; i <= n; i ++) ans += siz[i]; cout<<ans; } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }

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

bosses.cpp: In function 'void Freopen(std::string)':
bosses.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...