Submission #659160

#TimeUsernameProblemLanguageResultExecution timeMemory
659160ssenseBosses (BOI16_bosses)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #define startt ios_base::sync_with_stdio(false);cin.tie(0); typedef long long ll; using namespace std; #define vint vector<int> #define all(v) v.begin(), v.end() #define MOD 1000000007 #define MOD2 998244353 #define MX 1000000000 #define MXL 1000000000000000000 #define PI (ld)2*acos(0.0) #define pb push_back #define sc second #define fr first #define int long long #define endl '\n' #define ld long double #define NO cout << "NO" << endl #define YES cout << "YES" << endl int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu void solve() { int n; cin >> n; map<int, int> mp; vector<vector<int>> a(n, vector<int>()); int mx = 0, best = -1; for(int i = 0; i < n; i++) { int k; cin >> k; for(int j = 0; j < k; j++) { int boss; cin >> boss; boss--; a[i].pb(boss); mp[boss]++; if(mp[boss] > mx) { mx=mp[boss]; best = boss; } } } vector<int> height(n, -1); height[best] = 0; for(int bruh = 0; bruh < n; bruh++) { for(int i = 0; i < n; i++) { if(height[i] != -1) { continue; } int mn = MXL, par = -1; for(int j = 0; j < a[i].size(); j++) { if(height[a[i][j]] >= 0) { if(mn >= height[a[i][j]]) { mn = height[a[i][j]]; par = a[i][j]; } } } height[i] = mn+1; } } ll ans = 0; for(int i = 0; i < n; i++) { ans+=1+height[i]; } cout << ans << endl; } int32_t main(){ startt int t = 1; //cin >> t; while (t--) { solve(); } } /* 4 1 4 3 1 3 4 2 1 2 1 3 */

Compilation message (stderr)

bosses.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
bosses.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
bosses.cpp: In function 'void solve()':
bosses.cpp:58:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             for(int j = 0; j < a[i].size(); j++)
      |                            ~~^~~~~~~~~~~~~
bosses.cpp:57:27: warning: variable 'par' set but not used [-Wunused-but-set-variable]
   57 |             int mn = MXL, par = -1;
      |                           ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...