# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784116 | KindaNameless | Bosses (BOI16_bosses) | C++14 | 392 ms | 716 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
vector<int> adj[5001];
bool vis[5001];
int n, val, answer = 2e9;
void bfs(int cur){
queue<pair<int, int>> q;
vis[cur] = 1;
q.push({cur, 1});
int cnt = 0;
while(!q.empty()){
pair<int, int> now = q.front(); q.pop();
cnt++;
val += now.second;
for(int nx : adj[now.first]){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |