Submission #1062852

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062852		damjandavkov	Rail (IOI14_rail)	C++17	56 / 100	300 ms	98712 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
void findLocation(int N, int first, int location[], int stype[])
{
    location[0] = first;
    stype[0] = 1;
    int i, j, f, s, r = 99999999;
    vector<vector<int> > v(N);
    vector<int> di(N, r), cl(N);
    for (i = 1; i < N; i++)
        location[i] = stype[i] = -1;
    for (i = 0; i < N; i++)
    {
        v[i].resize(N);
        for (j = 0; j < N; j++)
        {
            if (j < i)
                v[i][j] = v[j][i];
            else if (j == i)
                v[i][j] = 0;
            else
                v[i][j] = getDistance(i, j);
            if (v[i][j] && v[i][j] < di[i])
            {
                di[i] = v[i][j];
                cl[i] = j;
            }
        }
    }
    f = cl[0];
    location[f] = first + di[0];
    stype[f] = 2;
    s = cl[f];
    location[s] = location[f] - di[f];
    stype[s] = 1;
    for (i = 1; i < N; i++)
    {
        if (i == f || i == s || cl[cl[i]] != i)
            continue;
        if (v[i][f] < v[i][s])
        {
            if (cl[i] == f || v[cl[i]][f] > v[i][f])
            {
                location[i] = location[f] - v[i][f];
                stype[i] = 1;
            }
            else
            {
                location[i] = location[f] - 2 * v[cl[i]][f] + v[i][f];
                stype[i] = 2;
            }
        }
        else
        {
            if (cl[i] == s || v[cl[i]][s] > v[i][s])
            {
                location[i] = location[s] + v[i][s];
                stype[i] = 2;
            }
            else
            {
                location[i] = location[s] + 2 * v[cl[i]][s] - v[i][s];
                stype[i] = 1;
            }
        }
    }
    for (i = 1; i < N; i++)
    {
        if (stype[i] == -1)
        {
            if (stype[cl[i]] == 1)
            {
                stype[i] = 2;
                location[i] = location[cl[i]] + di[i];
            }
            else
            {
                stype[i] = 1;
                location[i] = location[cl[i]] - di[i];
            }
        }
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 26 / 26
• Subtask 4: 0 / 44