#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef __int128 ll;
#define fi first
#define se second
ll dist[31][111111];
ll pw[31];
vector<pair<int,int>>adj[111111];
struct node{
int v;
int k;
ll d = 0;
node(){}
node(int _k,int _v,ll _d = 0){
v = _v;
k = _k;
d = _d;
}
};
bool cmp(ll a,ll b){return a < b;}
ll min(ll a,ll b){
if(cmp(a,b))return a;
else return b;
}
struct comp{
bool operator() (node a, node b) {return cmp(b.d,a.d);}
};
std::ostream& operator<<(std::ostream& o, const __int128& x) {
if (x == std::numeric_limits<__int128>::min()) return o << "-170141183460469231731687303715884105728";
if (x < 0) return o << "-" << -x;
if (x < 10) return o << (char)(x + '0');
return o << x / 10 << (char)(x % 10 + '0');
}
double solve(int n, int m,int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
for(int j=0;j<n;j++){
adj[j].clear();
for(int i=0;i<=30;i++){
dist[i][j] = numeric_limits<ll>::max();
}
}
pw[0] = 1;
for(int i=1;i<=30;i++)pw[i] = pw[i-1]*2;
for(int i=0;i<m;i++){
adj[x[i]].push_back({y[i],c[i]});
adj[y[i]].push_back({x[i],c[i]});
}
priority_queue<node,vector<node>,comp>pq;
dist[0][H] = 0;
pq.push(node(0,H));
while(!pq.empty()){
int v = pq.top().v;
int k = pq.top().k;
ll d = pq.top().d;
pq.pop();
if(d != dist[k][v])continue;
//cout<<k<<" "<<v<<" "<<d<<'\n';
for(auto x:adj[v]){
int u = x.fi;
ll w = x.se;
w *= pw[30-k];
if(u == H)continue;
if(cmp(d+w,dist[k][u])){
dist[k][u] = d + w;
pq.push(node(k,u,d+w));
}
/*
if(arr[u] == 2 && k+1 <= K && cmp(d+w,dist[k+1][u])){
dist[k+1][u] = d + w;
pq.push(node(k+1,u,d + w));
}*/
}
}
ll ans = dist[0][0];
for(int i=0;i<=K;i++)ans = min(ans,dist[i][0]);
queue<int>q;
vector<int>vis(n,0);
q.push(0);
vis[0] = 1;
while(!q.empty()){
int v = q.front();
q.pop();
if(arr[v] == 0)for(int i=0;i<=K;i++)ans = min(ans,dist[i][v]);
if(v == H)continue;
for(auto x:adj[v]){
int u = x.first;
if(!vis[u]){
q.push(u);
vis[u] = 1;
}
}
}
if(!vis[H])return -1;
long double fin = 0;
/*
for(int i=0;i<30;i++){
if(ans&pw[0]){
long double kek = 1;
kek/=(1LL<<(30-i));
fin += kek;
}
ans/=2;
}*/
ans/=pw[30];
for(int i=0;i<=30;i++){
if(ans&pw[0])fin += (1LL<<i);
ans/=2;
}
return fin;
}
Compilation message
cyberland.cpp:5:18: error: conflicting declaration 'typedef __int128 ll'
5 | typedef __int128 ll;
| ^~
cyberland.cpp:4:23: note: previous declaration as 'typedef long long int ll'
4 | typedef long long int ll;
| ^~
