# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
884359 |
2023-12-07T08:46:29 Z |
vjudge1 |
Bosses (BOI16_bosses) |
C++17 |
|
425 ms |
756 KB |
/*
#pragma GCC optimize("fast-math")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
*/
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
#define pb push_back
#define F first
#define S second
#define len(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define file freopen("txt.in", "r", stdin);freopen("txt.out", "w", stdout);
#define kill(x) {cout << x << '\n'; return 0;}
#define int long long
const int N = 5e3 + 5, LG = 21, MOD = 1e9+7;// 998244353
const ll inf = 4557430888798830399;
int n, ans, dist[N], cnt;
vector<int> g[N];
queue<int> q;
bitset<N> mark;
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i) {
int sz, v;
cin >> sz;
for(int j = 0; j < sz; ++j) {
cin >> v;
g[v].pb(i);
}
}
ll ans = inf;
for(int i = 1; i <= n; ++i) {
cnt = 1;
q.push(i);
dist[i] = 1;
while(!q.empty()){
int v = q.front();
mark[v] = 1;
q.pop();
for(int u : g[v])
if(!mark[u]) {
dist[u] = dist[v] + 1;
cnt += dist[u];
mark[u] = 1;
q.push(u);
}
}
if(mark.count() != n) {
mark.reset();
continue;
}
ans = min(ans, cnt);
mark.reset();
}
cout << ans;
return 0;
}
Compilation message
bosses.cpp: In function 'int main()':
bosses.cpp:60:25: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
60 | if(mark.count() != n) {
| ~~~~~~~~~~~~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
3 ms |
600 KB |
Output is correct |
13 |
Correct |
3 ms |
604 KB |
Output is correct |
14 |
Correct |
76 ms |
600 KB |
Output is correct |
15 |
Correct |
3 ms |
600 KB |
Output is correct |
16 |
Correct |
405 ms |
604 KB |
Output is correct |
17 |
Correct |
396 ms |
752 KB |
Output is correct |
18 |
Correct |
425 ms |
756 KB |
Output is correct |