Submission #388264

#	Time	Username	Problem	Language	Result	Execution time	Memory
388264		ACmachine	Towns (IOI15_towns)	C++17	13 / 100	22 ms	392 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int hubDistance(int n, int sub) {
    int bound = (7 * n) / 2 + ((7 * n)%2);
    vector<vector<int>> dist(n, vector<int>(n, -1));
    REP(i, n) dist[i][i] = 0;
    int num_queries = 0;
    auto get_dist = [&](int i, int j){
        if(dist[i][j] == -1){
            num_queries++;
            assert(num_queries <= bound);
            dist[i][j] = dist[j][i] = getDistance(i, j);
        }
        return dist[i][j];
    };
    auto solve_sub1 = [&](){
        FOR(i, 1, n, 1)
            get_dist(0, i);
        int f = 0, s;
        FOR(i, 1, n, 1){
            if(dist[0][i] > dist[0][f])
                f = i;
        }
        REP(i, n){
            get_dist(f, i);
        }
        s = 0;
        REP(i, n){
            if(dist[f][i] > dist[f][s])
                s = i;
        }
        REP(i, n) get_dist(s, i);
        auto solve_system = [](int a, int b, int c){
            // x1 + x2 = a;
            // x2 + x3 = b;
            // x1 + x3 = c;
            int x1 = (a + c - b) / 2;
            int x2 = (c + b - a) / 2;
            int x3 = (b + a - c) / 2;
            return make_tuple(x1, x2, x3);
        };
        int ans = INF;
        REP(i, n){
            if(i == f || i == s) continue;
            // df + ds = a;
            // ds + di = b;
            // df + di = c
            tuple<int, int, int> res = solve_system(get_dist(f, s), get_dist(s, i),  get_dist(f, i));
            int temp = max({get<0>(res), get<1>(res), get<2>(res)});
            ans = min(ans, temp);
        }
        return ans;
    };
	if(sub == 1)
	    return solve_sub1();
    else
        return 0;
}

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