Submission #1194245

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194245		steveonalex	Towns (IOI15_towns)	C++20	13 / 100	10 ms	328 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int hubDistance(int n, int subtask){
    int dis[n][n]; memset(dis, 0, sizeof dis);
    for(int i = 0; i < n; ++i) for(int j = i + 1; j < n; ++j) 
        dis[j][i] = dis[i][j] = getDistance(i, j);

    pair<int, int> diameter_pair = make_pair(0, 0);
    int dih = 0;
    for(int i= 0; i < n; ++i) for(int j = i + 1; j < n; ++j) 
        if (maximize(dih, dis[i][j])) diameter_pair = make_pair(i, j);

    int ans = 1e9 + 69;
    for(int i = 0; i < n; ++i) if (i != diameter_pair.first && i != diameter_pair.second){
        int cur = (dis[diameter_pair.first][i] - dis[diameter_pair.second][i] + dih) / 2;
        maximize(cur, dih - cur);
        minimize(ans, cur);
    }
    return ans;
}

// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

//     clock_t start = clock();

//     cerr << "Time elapsed: " << clock() - start << " ms!\n";

//     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