Submission #1205123

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205123		hungeazy	Cities (BOI16_cities)	C++20	100 / 100	1973 ms	45276 KiB

cities

/*
* @Author: hungeazy
* @Date:   2025-05-20 17:52:27
* @Last Modified by:   hungeazy
* @Last Modified time: 2025-05-21 11:40:20
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
// #pragma GCC optimize("O3")  
// #pragma GCC optimize("unroll-loops")  
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
using namespace std;
using namespace __gnu_pbds; 
bool M1;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define int long long
#define ll long long 
#define ull unsigned long long
#define sz(x) x.size()
#define sqr(x) (1LL * (x) * (x))
#define all(x) x.begin(), x.end()
#define fill(f,x) memset(f,x,sizeof(f))
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define FOD(i,r,l) for(int i=r;i>=l;i--)
#define debug(x) cout << #x << " = " << x << '\n'
#define ii pair<int,int>
#define iii pair<int,ii>
#define di pair<ii,ii>
#define vi vector<int>
#define vii vector<ii>
#define mii map<int,int>
#define fi first
#define se second
#define pb push_back
#define MOD 1000000007
#define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define MASK(i) (1LL << (i))
#define c_bit(i) __builtin_popcountll(i)
#define BIT(x,i) ((x) & MASK(i))
#define SET_ON(x,i) ((x) | MASK(i))
#define SET_OFF(x,i) ((x) & ~MASK(i))
#define oo 1e18
#define name ""
#define endl '\n'
#define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
#define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
const int N = (int)2e5+10;
int n,k,m,city[N],U[N],V[N],W[N];
vi g[N];
// BOI16 - Cities
namespace hungeazy {

    int dp[N][MASK(5)];

	void solve(void)
	{
        FOR(i,1,n)
            FOR(j,0,MASK(k)-1) dp[i][j] = oo;
        FOR(i,0,k-1) dp[city[i]][MASK(i)] = 0;
        priority_queue<ii,vii,greater<ii>> q;
        FOR(mask,0,MASK(k)-1)
        {
            for (int subMask = mask; subMask; subMask = (subMask-1)&mask)
                FOR(i,1,n)
                    minimize(dp[i][mask],dp[i][mask^subMask]+dp[i][subMask]);
            FOR(i,1,n)
                if (dp[i][mask] != oo)
                    q.push({dp[i][mask],i});
            while (!q.empty())
            {
                int u,cost;
                tie(cost,u) = q.top();
                q.pop();
                if (cost > dp[u][mask]) continue;
                for (int i : g[u])
                {
                    int v = U[i]+V[i]-u;
                    if (minimize(dp[v][mask],dp[u][mask]+W[i]))
                        q.push({dp[v][mask],v});
                }
            }
        }
        int ans = oo;
        FOR(i,1,n) minimize(ans,dp[i][MASK(k)-1]);
        cout << ans;
	}
	
}

bool M2;
signed main()
{
    fast;
    if (fopen(name".inp","r"))
    {
    	freopen(name".inp","r",stdin);
    	freopen(name".out","w",stdout);
    }
    cin >> n >> k >> m;
    FOR(i,0,k-1) cin >> city[i];
    FOR(i,1,m)
    {
        cin >> U[i] >> V[i] >> W[i];
        g[U[i]].pb(i); g[V[i]].pb(i);
    }
    hungeazy::solve();
    time();
    memory();
    return 0;
}
// ██░ ██  █    ██  ███▄    █   ▄████
//▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
//▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
//░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
//░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
// ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
// ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
// ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
// ░  ░  ░   ░              ░       ░

Compilation message (stderr)

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

• Subtask 1: 22 / 22
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 26 / 26