Submission #982089

#	Time	Username	Problem	Language	Result	Execution time	Memory
982089		alo_54	Cyberland (APIO23_cyberland)	C++17	0 / 100	28 ms	8028 KiB

cyberland

#include "cyberland.h"

#include <bits/stdc++.h>
using namespace std;

int h;

struct Arista
{
    int v, p;
};

struct Nodo
{
    vector <Arista> ady;
    int ability;
    int idx;
    int cost0, costP = 0;

};

struct Estado
{
    int p;
    int idx;
};

struct Comp
{
    bool operator() (Estado a, Estado b) const
    {
        return a.p > b.p;
    }
};

vector <Nodo> g;
vector <Arista> padre;
vector <bool> vis;

void clean(int N)
{
    g.clear();
    padre.clear();
    vis.clear();

    g.resize(N);
    padre.resize(N);
    vis.resize(N, false);
}

void dfs(int nodo)
{
    if (nodo == h)
    {
        return;
    }

    for (auto i : g[nodo].ady)
    {
        if (!vis[i.v])
        {
            padre[i.v] = {nodo, i.p};

           // cout<<"padre "<<i.v<<": "<<nodo<<" c: "<<i.p<<endl;
            vis[i.v] = true;
            dfs(i.v);
        }
        
    } 
}




double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) 
{
    h = H;
    clean(N);

    for (int i = 0; i < M; i++)
    {
        g[x[i]].ady.push_back({y[i], c[i]});
        g[y[i]].ady.push_back({x[i], c[i]});
    }

    for (int i = 0; i < N; i++)
    {
        g[i].ability = arr[i];
        g[i].idx = i;
    }

    ////////////

    if (N <= 3)
    {
        if (N == 2)
        {
            for (auto i : g[0].ady)
            {
                if (i.v == H)
                {
                    return (double) i.p;
                }
            }

            return (double) -1;
            
        }

        double minH = 1e9 + 10;
        bool alcanzado = false;
        double cost = 0;
        int aux = -1;
        double caux = 0;

        for (auto i : g[0].ady)
        {
            if (i.v == H)
            {
                alcanzado = true;
                minH = min(minH, (double)cost + i.p);
            }else
            {
                aux = i.v;
                caux = (double) i.p;
            }
             
        }

        if (aux != -1)
        {
            for(auto i : g[aux].ady)
            {
                if (i.v != 0)
                {
                    alcanzado = true;

                    if (g[aux].ability == 0)
                    {
                        minH = min((double)i.p, minH);
                    }

                    if (g[aux].ability == 2)
                    {
                        minH = min((double)i.p + (double)(caux/(double)2), minH);
                    }
                }
                
            }
        }
        

        

        if (!alcanzado)
        {
            return (double) -1;
        }else
        {
            return (double) minH;
        }  
    }

    ///////////dijkstra desde los 0's

    /*

    priority_queue <Estado, vector <Estado>, Comp> pq;

    vector <bool> assigned(N, false);

    for (auto i : g)
    {
        if (i.ability == 0)
        {
            assigned[i.idx] = true;
            pq.push({0, i.idx});
            g[i.idx].cost0 = 0;
        }
        
    }

    while (!pq.empty())
    {
        Estado curr = pq.top();
        pq.pop();

        if (!assigned[curr.idx])
        {
            g[curr.idx].cost0 = g[curr.idx].costP;
            assigned[curr.idx] = true;

            for (auto  i : g[curr.idx].ady)
            {
                g[i.v].costP = min(g[i.v].costP, curr.p+ i.p);
                pq.push({g[i.v].costP, i.v});
            }
            
        }
        
    }

    ////////////

    vis[0] = true;

    padre[0] = {-1, 0};

    dfs(0);

    int curr = H;

    vector <Arista> camino(N);

    while (curr != -1)
    {
        camino[padre[curr].v].v = curr; 
        camino[padre[curr].v].p = padre[curr].p; 

        curr = padre[curr].v;
    }
   // cout<<"xd"<<endl;

    double cost = 0;
    curr = 0;

    while (curr != h)
    {
        cost = min(cost, (double)g[curr].cost0);
        cost += (double)camino[curr].p;
        curr = camino[curr].v;

        if (curr == H)
        {
            break;
        }
        
    }

    cout<<cost<<endl;
    

    return (double)cost;

    */

}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:247:1: warning: control reaches end of non-void function [-Wreturn-type]
  247 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3