oj.uz

Submission #1083028

# Submission time Handle Problem Language Result Execution time Memory
1083028 2024-09-02T10:13:06 Z User0069 Cities (BOI16_cities) C++17
74 / 100
 5864 ms 262144 KB 
#include<bits/stdc++.h>
#define taskname ""
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define int long long
using namespace std;
#define Faster ios_base::sync_with_stdio(false);cin.tie(0);
const int maxn=2e5+33;
const int N=1e5;
const int mod=1e9+7;
const int INF=1e18;
int n,k,m,imp[maxn],dp[maxn][32],vis[maxn][32];
vector<int> adj[maxn];
struct edge
{
    int u,v,w;
}e[maxn];
struct ele
{
    int des,mask,dis;
};
bool operator <(ele a,ele b)
{
    return a.dis>b.dis;
}
priority_queue<ele> pq;
void dijkstra()
{
    for(int i=1;i<=n;i++)
    {
        if(imp[i])
        {
            pq.push({i,0,0});
        }
    }
    while(!pq.empty())
    {
        int des=pq.top().des;
        int dis=pq.top().dis;
        int mask=pq.top().mask;
        pq.pop();
        if(imp[des]) mask|=(1<<(imp[des]-1));
        if(vis[des][mask]) continue;
        dp[des][mask]=dis;
        vis[des][mask]=1;
        for(int i:adj[des])
        {
            int des1=e[i].u+e[i].v-des;
            pq.push({des1,mask,dis+e[i].w});
        }
        for(int i=1;i<(1<<k);i++)
        {
            if((i|mask)==mask)
            {
                if(vis[des][i]==0)
                {
                    dp[des][i]=dp[des][mask];
                    vis[des][i]=1;
                }
            }
        }
        for(int i=1;i<(1<<k);i++)
        {
            if((i|mask)==i)
            {
                if(vis[des][mask^i])
                {
                    pq.push({des,i,dp[des][mask]+dp[des][i^mask]});
                }
            }
        }
    }
}
signed main()
{
    if (fopen(taskname".INP","r"))
    {
        freopen(taskname".INP","r",stdin);
        freopen(taskname".OUT","w",stdout);
    }
    Faster
    cin>>n>>k>>m;
    for(int i=1;i<=k;i++)
    {
        int x;
        cin>>x;
        imp[x]=i;
    }
    for(int i=1;i<=m;i++)
    {
        cin>>e[i].u>>e[i].v>>e[i].w;
        adj[e[i].u].push_back(i);
        adj[e[i].v].push_back(i);
    }
    dijkstra();
    int ans=INF;
    for(int i=1;i<=n;i++)
    {
        if(vis[i][(1<<k)-1]) ans=min(ans,dp[i][(1<<k)-1]);
    }
    cout<<ans;
}

Compilation message

cities.cpp: In function 'int main()':
cities.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(taskname".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:82:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen(taskname".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6580 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1566 ms 95140 KB Output is correct
2 Correct 1626 ms 94748 KB Output is correct
3 Correct 365 ms 71616 KB Output is correct
4 Correct 1261 ms 119644 KB Output is correct
5 Correct 497 ms 82676 KB Output is correct
6 Correct 440 ms 68240 KB Output is correct
7 Correct 6 ms 7512 KB Output is correct
8 Correct 3 ms 7260 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 7772 KB Output is correct
2 Correct 12 ms 9816 KB Output is correct
3 Correct 4 ms 7004 KB Output is correct
4 Correct 11 ms 7772 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5014 ms 171004 KB Output is correct
2 Correct 5864 ms 168460 KB Output is correct
3 Correct 1896 ms 112512 KB Output is correct
4 Correct 3995 ms 96116 KB Output is correct
5 Correct 4204 ms 220388 KB Output is correct
6 Correct 3099 ms 219892 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 2852 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -