| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 968060 |
2024-04-23T07:30:03 Z |
yeediot |
Cities (BOI16_cities) |
C++17 |
|
87 ms |
21328 KB |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
const int inf=1e9;
vector<int>need;
vector<pii>adj[mxn];
int n,k;
int dp[1<<5][mxn];
void dij(int x){
int st=need[x];
priority_queue<pii,vector<pii>,greater<pii>>pq;
for(int i=1;i<=n;i++){
if(dp[x][i]!=inf)pq.push({dp[x][i],i});
}
while(sz(pq)){
auto [d,v]=pq.top();
pq.pop();
if(d>dp[x][v])continue;
for(auto [u,l]:adj[v]){
if(dp[x][v]+l<dp[x][u]){
dp[x][u]=dp[x][v]+l;
pq.push({dp[x][u],u});
}
}
}
}
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int m;
cin>>n>>k>>m;
for(int i=0;i<(1<<k);i++){
for(int j=0;j<n;j++){
dp[i][j]=inf;
}
}
for(int i=0;i<k;i++){
int x;
cin>>x;
x--;
need.pb(x);
dp[1<<i][x]=0;
}
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
adj[a].pb({b,c});
adj[b].pb({a,c});
}
for(int i=1;i<(1<<k);i++){
for(int j=0;j<n;j++){
for(int h=i;h>0;h=(h-1&i)){
if((i^h)>h)break;
chmin(dp[i][j],dp[h][j]+dp[i^h][j]);
}
debug(dp[i][j]);
}
dij(i);
}
int ans=inf;
for(int i=0;i<n;i++){
chmin(ans,dp[(1<<k)-1][i]);
}
cout<<ans<<'\n';
}
/*
input:
*/
Compilation message
cities.cpp: In function 'void dij(int)':
cities.cpp:60:9: warning: unused variable 'st' [-Wunused-variable]
60 | int st=need[x];
| ^~
cities.cpp: In function 'int main()':
cities.cpp:105:33: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
105 | for(int h=i;h>0;h=(h-1&i)){
| ~^~
cities.cpp: In function 'void setIO(std::string)':
cities.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 3 |
Incorrect |
2 ms |
6748 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
67 ms |
13404 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
9048 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
73 ms |
15188 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
87 ms |
21328 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
