Submission #1009604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009604		c2zi6	Rail (IOI14_rail)	C++14	0 / 100	49 ms	604 KiB

rail

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "rail.h"

void findLocation(int n, int LOCATION0, int location[], int stype[]) {
    int f = 0;
    stype[f] = 1;
    location[f] = LOCATION0;
    if (n == 1) return;
    int s;
    int mid = 2e9;
    VI distf(n);
    rep(i, n) if (i != f) {
        distf[i] = getDistance(f, i);
        if (distf[i] < mid) {
            s = i;
            mid = distf[i];
        }
    }
    stype[s] = 2;
    location[s] = location[0] + mid;

    VI dists(n);
    rep(i, n) if (i != s) {
        dists[i] = getDistance(s, i);
    }
    
    /*cout << s << " " << mid << endl;*/
    /*cout << "distf, dists - 2*mid" << endl;*/
    /*rep(i, n) {*/
    /*    cout << distf[i] << ", " << dists[i]-mid << endl;*/
    /*}*/
    /*cout << "distf, dists - 2*mid" << endl;*/

    rep(i, n) if (i != f && i != s) {
        if (distf[i] == dists[i]-mid) {
            stype[i] = 2;
            location[i] = location[0] + distf[i];
        } else {
            stype[i] = 1;
            location[i] = location[0] - (distf[i] - 2*mid);
        }
    }

    cout << endl;
    rep(i, n) cout << stype[i] << " " << location[i] << endl;
}

Compilation message (stderr)

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:49:11: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |     stype[s] = 2;
      |           ^

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