# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176486 | JungPS | Bosses (BOI16_bosses) | C++17 | 370 ms | 756 KiB |
#include<iostream>
#include<vector>
#include<utility>
#include<queue>
#include<cstring>
using namespace std;
#define int long long
vector<int> vec[5007];
bool visited[5007];
int cnt,cost;
int n;
void bfs(int x){
queue<pair<int,int>> q;
q.push({x,1});
visited[x]=true;
while(!q.empty()){
pair<int,int> p=q.front();
q.pop();
++cnt;
cost+=p.second;
for(auto i:vec[p.first]){
if(visited[i]) continue;
visited[i]=1;
q.push({i,p.second+1});
}
}
}
signed main(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |