Submission #1021011

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021011		EkinOnal	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	1 ms	4444 KiB

crocodile

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
//#include <cstdio>
//#include <iostream>
using namespace std;
 
#define MAX 100007
#define pb push_back
//#define mp make_pair 
//#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
//const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;ans%=mod;a%=mod;b>>=1;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}


int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

#define N 50



int solve(int n, int m, int (*edges)[2], int* l, int k, int *entry) 
{	

	vector<pii> adj[n+5];
	for(int i=0;i<m;i++)
	{
		int a = edges[i][0], b = edges[i][1], c = l[i];
		adj[b].pb({a,c}); adj[a].pb({b,c});
	}

	priority_queue<pii,vector<pii>,greater<pii>> pq;
	vector<priority_queue<int>> dp(n);
	vi vis(n);

	for(int i=0;i<k;i++)
	{
		pq.push({0,entry[i]});
		vis[entry[i]]++;
		dp[entry[i]].push(0); dp[entry[i]].push(0);
	}
	
	while(pq.size())
	{
		int node = pq.top().s, cost=pq.top().f;
		pq.pop();
		if(vis[node]>1) continue;
		if(vis[node]++) continue;
	//	vis[node]++;
	//	if(vis[node]!=2) continue;
		if(node==0) return cost;

		//if(cost != )
		for (auto child : adj[node]) {
            int ch = child.f, wt = child.s;
            if (dp[ch].size() == 2) {
               // sort (all(dp[ch]));
                if (cost+wt < dp[ch].top()) {
                    dp[ch].pop();
                    dp[ch].push(cost+wt);
                    pq.push({cost+wt, ch});
                }
            }
            else {
                dp[ch].push(cost+wt);
                pq.push({cost+wt, ch});
            }
        }
	}
	
	cout << "BAD\n";
	
	
    return -1;
}	



int travel_plan(int n, int m, int (*r)[2], int* l, int k, int *p) {
    return solve(n, m, r, l, k, p);
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11