oj.uz

Submission #1083037

# Submission time Handle Problem Language Result Execution time Memory
1083037 2024-09-02T10:38:51 Z User0069 Cities (BOI16_cities) C++17
74 / 100
 6000 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=1e5+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[2*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;
            if(!vis[des1][mask])
            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]&&!vis[des][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: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".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen(taskname".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1027 ms 92744 KB Output is correct
2 Correct 963 ms 92184 KB Output is correct
3 Correct 269 ms 66752 KB Output is correct
4 Correct 515 ms 65164 KB Output is correct
5 Correct 322 ms 74112 KB Output is correct
6 Correct 196 ms 40472 KB Output is correct
7 Correct 5 ms 3672 KB Output is correct
8 Correct 3 ms 3656 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4188 KB Output is correct
2 Correct 9 ms 4188 KB Output is correct
3 Correct 3 ms 3348 KB Output is correct
4 Correct 7 ms 3676 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3230 ms 117468 KB Output is correct
2 Correct 3623 ms 166056 KB Output is correct
3 Correct 1575 ms 109776 KB Output is correct
4 Correct 2235 ms 91740 KB Output is correct
5 Correct 1669 ms 119644 KB Output is correct
6 Correct 1210 ms 116092 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6031 ms 262144 KB Time limit exceeded
2 Halted 0 ms 0 KB -