Submission #920101

#	Time	Username	Problem	Language	Result	Execution time	Memory
920101		Juanchoki	Dreaming (IOI13_dreaming)	C++14	65 / 100	581 ms	32328 KiB

dreaming

#include"dreaming.h"
#include <bits/stdc++.h>
using namespace std;
struct edge
{
    int u, w;
};
struct tpos
{
    int nodo, dist, padre;
};
int maxn;
const int MAXN = 2e5 + 4;
int Visi[MAXN];
vector<vector<edge>> adj;
pair<int, int> bfs (int nodo)
{
        pair<int, int> ret;
        ret.second = -1;
        queue<tpos> q; 
        q.push({nodo, 0, -1});
        tpos temp_tpos;
        vector<bool> visi(maxn);
        while (!q.empty())
        {
            temp_tpos = q.front(); q.pop();
            visi[temp_tpos.nodo] = 1;
            Visi[temp_tpos.nodo] = 1;
            //cout << "    " << temp_tpos.nodo <<  " " << temp_tpos.dist << "\n";
            for (edge e: adj[temp_tpos.nodo])
            {
           //     cout << temp_tpos.nodo << " vecinos: " << e.u << '\n';
                if (visi[e.u]) continue;
                q.push({e.u, temp_tpos.dist+e.w, temp_tpos.nodo}); 
            }
            if (temp_tpos.dist > ret.second)
            {
                ret.second = temp_tpos.dist;
                ret.first = temp_tpos.nodo;
            }
        }
    //cout << '\n';
    return ret;
}
tpos Diametro (int pos)
{
    int ve = bfs(pos).first;
    tpos ttpos;
    ttpos.nodo = ve;
    pair<int, int> par = bfs(ve);
    ttpos.dist = par.first;
    ttpos.padre = par.second;
    return ttpos;
}

void DFS(int nodo, int dist, map<int, bool> &visit, map<int, int> &ret)
{
    visit[nodo] = 1;
    ret[nodo] = dist;
    for (edge &e: adj[nodo])
        if (visit[e.u]) continue;
        else DFS(e.u, dist + e.w, visit, ret);
}

int distanciaxdd (int nodo, map<int, bool> &visit, map<int, int> &a, map<int, int> &b)
{
    visit[nodo] = 1;
    int mini = max(a[nodo], b[nodo]);
    for (edge &e: adj[nodo])
        if (visit[e.u]) continue;
        else mini = min (mini, distanciaxdd(e.u, visit, a, b));
    return mini;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) 
{
    maxn = N;
    adj.resize(N);
    edge temp_edge;
    for (int i = 0; i < M; i++)
    {
        temp_edge.u = B[i];
        temp_edge.w = T[i];
        adj[A[i]].push_back(temp_edge);
        temp_edge.u = A[i];
        adj[B[i]].push_back(temp_edge);
    }
    priority_queue<pair<int, int>> pq;
    pair<int, int> par;

    for (int i = 0; i < N; i++)
    {
        if (Visi[i]) continue;
        tpos ttpos = Diametro(i);
        par.first = ttpos.padre;
        map<int, int> uno, dos;
        map<int, bool> visit;
        DFS(ttpos.nodo, 0, visit, uno);
        visit.clear();
        DFS(ttpos.dist, 0, visit, dos);
        visit.clear();
        par.second = distanciaxdd(i, visit, uno, dos);
       // cout << i << " " << par.first << " " << par.second << '\n';
        pq.push(par);
    }
        
    while (pq.size() > 1)
    {
        pair<int, int> a1 = pq.top(); pq.pop();
        pair<int, int> a2 = pq.top(); pq.pop();
        pair<int, int> temporal;
        temporal.first = max(a1.first, max(a2.first, a1.second + a2.second + L));
        temporal.second = min (max (a1.second + L, a2.second), max(a2.second + L, a1.second));
        pq.push(temporal);
    }

    return pq.top().first;
}

• Subtask 1: 14 / 14
• Subtask 2: 10 / 10
• Subtask 3: 23 / 23
• Subtask 4: 18 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23