oj.uz

Submission #745903

# Submission time Handle Problem Language Result Execution time Memory
745903 2023-05-21T09:29:54 Z vjudge1 Cities (BOI16_cities) C++11
29 / 100
 6000 ms 61444 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long int

int n,m,k;
vector<int> t[100005];
vector<int> w[100005];
vector<int> imp;
int a,b,c;
vector<int> dist[5];

void Dijkstra(int p,vector<int> &q) {
    set<pair<int,int> > s; s.clear();
    s.insert( {0,p} );
    q.assign(n+1,-1);
    int len,to;
    while (s.size()>0) {
        len=(*s.begin()).first;
        to=(*s.begin()).second;
        s.erase(s.begin());
        if (q[to]==-1) {
            q[to]=len;
            for (int i=0;i<t[to].size();i++) {
                s.insert( {len+w[to][i],t[to][i]} );
            }
        }
    }
}

void kiir() {
    for (int i=0;i<k;i++) {
        cout << imp[i] << ": " << endl;
        for (int j=1;j<=n;j++) {
            cout << j << ": " << dist[i][j] << endl;
        }
        cout << endl;
    }
}
vector<int> dis[1001];

void Dijkstra2(int p,vector<int> &q) {
    set<pair<int,int> > s; s.clear();
    s.insert( {0,p} );
    q.assign(n+3,-1);
    int len,to;
    while (s.size()>0) {
        len=(*s.begin()).first;
        to=(*s.begin()).second;
        s.erase(s.begin());
        if (q[to]==-1) {
            q[to]=len;
            for (int i=0;i<t[to].size();i++) {
                s.insert( {len+w[to][i],t[to][i]} );
            }
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k >> m;
    for (int i=1;i<=k;i++) {
        cin >> a;
        imp.push_back(a);
    }
    for (int i=1;i<=m;i++) {
        cin >> a >> b >> c;
        t[a].push_back(b);
        t[b].push_back(a);
        w[a].push_back(c);
        w[b].push_back(c);
    }
    if (k==2) {
        for (int i=0;i<k;i++) {
            Dijkstra(imp[i],dist[i]);
        }
        cout << dist[0][imp[1]] << endl;
        return(0);
    }
    if (k==3) {
        for (int i=0;i<k;i++) {
            Dijkstra(imp[i],dist[i]);
        }
        int ans=1e18;
        for (int i=1;i<=n;i++) {
            ans=min(ans,dist[0][i]+dist[1][i]+dist[2][i]);
        }
        cout << ans << endl;
        return(0);
    }

    if ((k==4) && (n<=1000)) {
        for (int i=1;i<=n;i++) {
            Dijkstra(i,dis[i]);
        }
        int ans=1e18;
        for (int i=1;i<=n;i++) {
            for (int j=1;j<=n;j++) {
                ans=min(ans,dis[imp[0]][i]+dis[imp[1]][i]+dis[i][j]+dis[j][imp[2]]+dis[j][imp[3]]);
                ans=min(ans,dis[imp[0]][i]+dis[imp[2]][i]+dis[i][j]+dis[j][imp[1]]+dis[j][imp[3]]);
                ans=min(ans,dis[imp[0]][i]+dis[imp[3]][i]+dis[i][j]+dis[j][imp[1]]+dis[j][imp[2]]);
            }
        }
        cout << ans << endl;
        return(0);
    }

    if (k==4) {
        int ans=1e18;
        for (int i=0;i<k;i++) {
            Dijkstra(imp[i],dist[i]);
        }
        //kiir();
        vector<int> r; r.clear();

        for (int i=1;i<=n;i++) {
            t[n+1].push_back(i);
            w[n+1].push_back(dist[0][i]+dist[1][i]);
            t[i].push_back(n+1);
            w[i].push_back(dist[0][i]+dist[1][i]);
        }
        for (int i=1;i<=n;i++) {
            t[n+2].push_back(i);
            w[n+2].push_back(dist[2][i]+dist[3][i]);
            t[i].push_back(n+2);
            w[i].push_back(dist[2][i]+dist[3][i]);
        }
        Dijkstra2(n+1,r);
        ans=min(ans,r[n+2]);
        t[n+1].clear();
        t[n+2].clear();
        w[n+1].clear();
        w[n+2].clear();
        for (int i=1;i<=n;i++) {
            t[i].pop_back();
            t[i].pop_back();
            w[i].pop_back();
            w[i].pop_back();
        }

        for (int i=1;i<=n;i++) {
            t[n+1].push_back(i);
            w[n+1].push_back(dist[0][i]+dist[2][i]);
            t[i].push_back(n+1);
            w[i].push_back(dist[0][i]+dist[2][i]);
        }
        for (int i=1;i<=n;i++) {
            t[n+2].push_back(i);
            w[n+2].push_back(dist[1][i]+dist[3][i]);
            t[i].push_back(n+2);
            w[i].push_back(dist[1][i]+dist[3][i]);
        }
        r.clear();
        Dijkstra2(n+1,r);
        ans=min(ans,r[n+2]);
        t[n+1].clear();
        t[n+2].clear();
        w[n+1].clear();
        w[n+2].clear();
        for (int i=1;i<=n;i++) {
            t[i].pop_back();
            t[i].pop_back();
            w[i].pop_back();
            w[i].pop_back();
        }

        for (int i=1;i<=n;i++) {
            t[n+1].push_back(i);
            w[n+1].push_back(dist[0][i]+dist[3][i]);
            t[i].push_back(n+1);
            w[i].push_back(dist[0][i]+dist[3][i]);
        }
        for (int i=1;i<=n;i++) {
            t[n+2].push_back(i);
            w[n+2].push_back(dist[2][i]+dist[1][i]);
            t[i].push_back(n+2);
            w[i].push_back(dist[2][i]+dist[1][i]);
        }
        r.clear();
        Dijkstra2(n+1,r);
        ans=min(ans,r[n+2]);

        cout << ans << endl;
        return(0);

    }
    return 0;
}

/*
8 4 12
1 3 4 7
1 2 1
2 3 1
3 4 20
4 5 6
5 6 9
6 7 11
7 8 10
1 8 4
8 4 5
2 7 8
3 6 3
5 7 6
*/

Compilation message

cities.cpp: In function 'void Dijkstra(long long int, std::vector<long long int>&)':
cities.cpp:24:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             for (int i=0;i<t[to].size();i++) {
      |                          ~^~~~~~~~~~~~~
cities.cpp: In function 'void Dijkstra2(long long int, std::vector<long long int>&)':
cities.cpp:53:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             for (int i=0;i<t[to].size();i++) {
      |                          ~^~~~~~~~~~~~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Incorrect 2 ms 4948 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 897 ms 29784 KB Output is correct
2 Correct 931 ms 30352 KB Output is correct
3 Correct 205 ms 13752 KB Output is correct
4 Correct 964 ms 37756 KB Output is correct
5 Correct 654 ms 29044 KB Output is correct
6 Correct 699 ms 37708 KB Output is correct
7 Correct 6 ms 5204 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 739 ms 13016 KB Output is correct
2 Correct 735 ms 13052 KB Output is correct
3 Correct 194 ms 12812 KB Output is correct
4 Correct 377 ms 7416 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3183 ms 54744 KB Output is correct
2 Correct 3050 ms 61444 KB Output is correct
3 Correct 1136 ms 45356 KB Output is correct
4 Correct 2948 ms 49100 KB Output is correct
5 Correct 2132 ms 42288 KB Output is correct
6 Execution timed out 6040 ms 44760 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 151 ms 17416 KB Output isn't correct
2 Halted 0 ms 0 KB -