Submission #1043394

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043394		mindiyak	Rail (IOI14_rail)	C++14	30 / 100	34 ms	604 KiB

rail

#include "rail.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
void findLocation(int N, int first, int location[], int stype[])
{
    location[0] = first;
    stype[0] = 1;
 
    if(N == 1)return;
 
    vi dist(N,0);
    int min_pos = -1,min_dis = -1;
 
    FOR(i,1,N){
        int val = getDistance(0,i);
        if(val < min_dis || min_dis == -1){
            min_dis = val;
            min_pos = i;
        }
        dist[i] = val;
    }
 
    stype[min_pos] = 2;
    location[min_pos] = min_dis + location[0];
 
    FOR(i,1,N){
        if(i == min_pos)continue;
 
        int val = getDistance(min_pos,i);
        
        if(val < dist[i]){
            stype[i] = 1;
            location[i] = location[min_pos] - val;
        }else{
            stype[i] = 2;
            location[i] = first+dist[i];
        }
    }
 
 
 
}

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