Submission #1147480

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147480		alexdd	Towns (IOI15_towns)	C++20	0 / 100	1 ms	328 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n;
vector<int> calc_dist(int src)
{
    vector<int> dist(n);
    for(int i=0;i<n;i++)
        dist[i] = getDistance(src,i);
    return dist;
}
int hubDistance(int N, int sub)
{
    //int _ = getDistance(0,1);
    n = N;
    vector<int> dist0 = calc_dist(0);
    int cap1=0;
    for(int i=0;i<n;i++)
        if(dist0[i]>dist0[cap1])
            cap1=i;
    vector<int> dist1 = calc_dist(cap1);
    int cap2=0;
    for(int i=0;i<n;i++)
        if(dist1[i]>dist1[cap2])
            cap2=i;
    vector<int> dist2 = calc_dist(cap2);
    int mnm = dist1[cap2];
    vector<int> injos(n);
    for(int i=0;i<n;i++)
    {
        injos[i] = dist1[i] + dist2[i] - dist1[cap2];
        assert(injos[i]%2==0);
        injos[i]/=2;
        mnm = min(mnm, max(dist1[i], dist2[i]) - injos[i]);
    }
    bool gasit=0;
    for(int i=0;i<n;i++)
    {
        if(max(dist1[i], dist2[i]) - injos[i] == mnm)
        {
            int cntst=0,cntmij=0,cntdr=0;
            vector<int> vmij;
            for(int j=0;j<n;j++)
            {
                if(dist1[j]-injos[j] < dist1[i]-injos[i])
                {
                    cntst++;
                }
                else if(dist1[j]-injos[j] == dist1[i]-injos[i])
                {
                    cntmij++;
                    vmij.push_back(j);
                }
                else
                {
                    cntdr++;
                }
            }
            if(max(cntst,cntdr) <= n/2)
            {
                //mai trebuie sa verific daca toti copii nodului ales din diametru sunt <=n/2
                if(cntmij <= n/2)
                {
                    gasit=1;
                    break;
                }
                int care=-1, cnt=0;
                for(int x:vmij)
                {
                    if(cnt==0)
                    {
                        care = x;
                        cnt = 1;
                    }
                    else if(getDistance(care,x) == injos[x] + injos[care])
                    {
                        cnt--;
                    }
                    else
                    {
                        cnt++;
                    }
                }
                cnt=(int)vmij.size();
                for(int x:vmij)
                {
                    if(x!=care && getDistance(care,x) == injos[x] + injos[care])
                    {
                        cnt--;
                    }
                }
                if(cnt <= n/2)
                {
                    gasit=1;
                    break;
                }
            }
        }
    }


    if(!gasit)
        mnm = -mnm;
    return mnm;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39