oj.uz

Submission #287307

# Submission time Handle Problem Language Result Execution time Memory
287307 2020-08-31T15:14:32 Z evpipis Towns (IOI15_towns) C++11
100 / 100
 38 ms 440 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;

const int len = 115;
int n, s, a, b, dep[len];
map<ii, int> mym;
map<int, vector<int> > adj;

int ask(int a, int b){
    if (a > b)
        swap(a, b);
    if (mym.count(mp(a, b)))
        return mym[mp(a, b)];
    return mym[mp(a, b)] = getDistance(a, b);
}

void fix_graph(){
    s = 0, a = 0, b = 0;
    for (int i = 0; i < n; i++)
        if (ask(s, i) > ask(s, a))
            a = i;
    for (int i = 0; i < n; i++)
        if (ask(a, i) > ask(a, b))
            b = i;

    adj.clear();
    for (int i = 0; i < n; i++){
        int pos = (ask(a, i)+ask(a, s)-ask(s, i))/2;
        adj[pos].pb(i);

        dep[i] = (ask(a, i)+ask(s, i)-ask(a, s))/2;

        //printf("i = %d, dep = %d, pos = %d\n", i, dep[i], pos);
    }
}

void find_hubs(int &R, vector<int> &hubs){
    int diam = ask(a, b);

    R = diam;
    hubs.clear();
    for (auto &it: adj){
        int pos = it.fi;

        if (max(pos, diam-pos) < R)
            hubs.clear(), hubs.pb(pos), R = max(pos, diam-pos);
        else if (max(pos, diam-pos) == R)
            hubs.pb(pos);
    }
}

bool check(int a, int b){
    return (ask(a, b) < dep[a]+dep[b]);
}

bool check_cent(vector<int> ball){
    vector<int> stck;
    vector<vector<ii> > cons;
    for (int i = 0; i < ball.size(); i++){
        int cur = ball[i];
        if (stck.empty())
            cons.pb(vector<ii>(0));

        if (!stck.empty() && !check(stck.back(), cur))
            cons.back().pb(mp(stck.back(), cur)), stck.pop_back();
        else
            stck.pb(cur);
    }

    if (stck.empty())
        return true;

    int cnt = stck.size();
    for (int i = 0; i < cons.size(); i++){
        if (cons[i].empty()) continue;

        if (check(cons[i][0].fi, stck.back())){
            cnt += cons[i].size();
            continue;
        }

        for (int j = 0; j < cons[i].size(); j++)
            if (check(cons[i][j].se, stck.back()))
                cnt++;
    }

    return (cnt <= n/2);
}

int hubDistance(int N, int sub) {
    mym.clear(), n = N;

    vector<int> hubs;
    int R, balanced = 0;

    fix_graph();

    find_hubs(R, hubs);

    auto it = adj.begin();
    int lef = 0;
    for (auto pos: hubs){
        while ((*it).fi < pos)
            lef += (*it).se.size(), it++;

        int sz = (*it).se.size();
        if (lef <= n/2 && sz <= n/2 && (n-lef-sz) <= n/2)
            balanced = 1;
        if (sz > n/2 && check_cent((*it).se))
            balanced = 1;
    }

    if (balanced)
        return R;
    else
        return -R;
}

Compilation message

towns.cpp: In function 'int ask(int, int)':
towns.cpp:16:21: warning: declaration of 'b' shadows a global declaration [-Wshadow]
   16 | int ask(int a, int b){
      |                     ^
towns.cpp:12:14: note: shadowed declaration is here
   12 | int n, s, a, b, dep[len];
      |              ^
towns.cpp:16:21: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   16 | int ask(int a, int b){
      |                     ^
towns.cpp:12:11: note: shadowed declaration is here
   12 | int n, s, a, b, dep[len];
      |           ^
towns.cpp: In function 'bool check(int, int)':
towns.cpp:59:24: warning: declaration of 'b' shadows a global declaration [-Wshadow]
   59 | bool check(int a, int b){
      |                        ^
towns.cpp:12:14: note: shadowed declaration is here
   12 | int n, s, a, b, dep[len];
      |              ^
towns.cpp:59:24: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   59 | bool check(int a, int b){
      |                        ^
towns.cpp:12:11: note: shadowed declaration is here
   12 | int n, s, a, b, dep[len];
      |           ^
towns.cpp: In function 'bool check_cent(std::vector<int>)':
towns.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < ball.size(); i++){
      |                     ~~^~~~~~~~~~~~~
towns.cpp:80:24: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   80 |     int cnt = stck.size();
      |               ~~~~~~~~~^~
towns.cpp:81:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for (int i = 0; i < cons.size(); i++){
      |                     ~~^~~~~~~~~~~~~
towns.cpp:85:33: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   85 |             cnt += cons[i].size();
      |                                 ^
towns.cpp:89:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for (int j = 0; j < cons[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:111:34: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  111 |             lef += (*it).se.size(), it++;
      |                                  ^
towns.cpp:113:31: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  113 |         int sz = (*it).se.size();
      |                  ~~~~~~~~~~~~~^~
towns.cpp:97:28: warning: unused parameter 'sub' [-Wunused-parameter]
   97 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 384 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 38 ms 384 KB Output is correct
5 Correct 22 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 384 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 28 ms 384 KB Output is correct
4 Correct 23 ms 440 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 35 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 23 ms 384 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 384 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 440 KB Output is correct
2 Correct 27 ms 384 KB Output is correct
3 Correct 27 ms 384 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 24 ms 384 KB Output is correct
3 Correct 24 ms 384 KB Output is correct