oj.uz

답안 #937104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937104 2024-03-03T13:31:48 Z 1075508020060209tc Cities (BOI16_cities) C++14
14 / 100
 852 ms 34732 KB 
#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
#define int long long
int n;int K;int m;
int imp[8];
vector<pair<int,int>>e[100005];

void dijkstera(vector<int>ost,vector<int>&dis){
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
for(int i:ost){
    pq.push({dis[i],i});
}
bitset<100005>vis;
while(pq.size()){
    int nw=pq.top().second;
    pq.pop();
    if(vis[nw]){continue;}
    vis[nw]=1;
    for(auto pr:e[nw]){
        int v=pr.first;
        int w=pr.second;
        if(vis[v]){continue;}
        if(dis[v]>dis[nw]+w){
            dis[v]=dis[nw]+w;
            pq.push({dis[v],v});
        }
    }
}
}

vector<int>disa[6];
vector<int>disab[6][6];
void init(){
cin>>n>>K>>m;
for(int i=1;i<=K;i++){
    cin>>imp[i];
    disa[i].resize(n+10,0);
}



for(int i=1;i<=m;i++){
    int a;int b;int c;
    cin>>a>>b>>c;
    e[a].push_back({b,c});
    e[b].push_back({a,c});
}
}


signed main(){
init();
for(int i=1;i<=K;i++){
    for(int j=1;j<=n;j++){
        disa[i][j]=1e16;
    }
    disa[i][imp[i]]=0;
    vector<int>vc={imp[i]};
    dijkstera(vc,disa[i]);
}
if(K==2){
    cout<<disa[1][imp[2]];return 0;
}
for(int i=1;i<=K;i++){
    for(int j=i+1;j<=K;j++){
        //if(i==j){continue;}
        disab[i][j].resize(n+10);
        vector<int>vc;
        for(int v=1;v<=n;v++){
            disab[i][j][v]=disa[i][v]+disa[j][v];
            vc.push_back(v);
        }
        dijkstera(vc,disab[i][j]);
    }
}
int ans=1e18;
ans=disab[1][2][imp[3]];
cout<<ans<<endl;


}

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Incorrect 1 ms 2652 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 27268 KB Output is correct
2 Correct 382 ms 26640 KB Output is correct
3 Correct 229 ms 18184 KB Output is correct
4 Correct 128 ms 11860 KB Output is correct
5 Correct 220 ms 16472 KB Output is correct
6 Correct 123 ms 15316 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 573 ms 30168 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 852 ms 34732 KB Output isn't correct
2 Halted 0 ms 0 KB -