oj.uz

Submission #74167

# Submission time Handle Problem Language Result Execution time Memory
74167 2018-08-30T10:55:22 Z funcsr Towns (IOI15_towns) C++17
35 / 100
 31 ms 784 KB 
#include "towns.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#define rep(i, N) for (int i=0; i<(N); i++)
#define pb push_back
#define _1 first
#define _2 second
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define INF 1145141919
using namespace std;
typedef pair<int, int> P;
struct UF {
  int U[111];
  int R[111];
  UF(int N) {
    rep(i, N) U[i] = i, R[i] = 1;
  }
  int find(int x) {
    if (U[x]==x)return x;
    return U[x]=find(U[x]);
  }
  void unite(int x, int y) {
    x=find(x), y=find(y);
    if(x==y)return;
    U[y]=x;
    R[x]+=R[y];
  }
};

int N;
int memo[111][111];
int Rank[111];
int dist(int a, int b) {
  if (memo[a][b] != -1) return memo[a][b];
  return memo[a][b] = getDistance(a, b);
}
int saien(int x) {
  P mp = P(-1, -1);
  rep(t, N) mp = max(mp, P(dist(x, t), t));
  return mp._2;
}
bool same(int x, int y) {
  if (x==y)return true;
  //cout<<"same("<<x<<","<<y<<")? = "<<dist(x,y)-Rank[x]-Rank[y]<<"\n";
  return dist(x,y)-Rank[x]-Rank[y]!=0;
}

/*
P solve(vector<int> list) {
  if (list.size() == 1) return P(1, list[0]);
  vector<int> l, r;
  rep(i, list.size()) if (i%2==0)l.pb(list[i]); else r.pb(list[i]);
  P a = solve(l);
  P b = solve(r);
  if (same(a._2, b._2)) {
    cout<<"solve({";for(int x:list)cout<<x<<",";cout<<"}) = "<<a._1+b._1<<" (repr="<<a._2<<")\n";
  }
  else {
    cout<<"solve({";for(int x:list)cout<<x<<",";cout<<"}) = "<<max(a,b)._1<<" (repr="<<max(a,b)._2<<")\n";
  }
  if (same(a._2, b._2)) return P(a._1+b._1, a._2);
  else return max(a, b);
}
*/

int hubDistance(int NN, int sub) {
  N=NN;
  rep(i, N) rep(j, N) memo[i][j] = -1;
  rep(i, N) memo[i][i] = 0;

  int u = saien(0);
  int v = saien(u);
  vector<int> pos;
  int L = dist(u, v);
  pos.pb(0);
  pos.pb(L);
  map<int, vector<int> > G;
  rep(x, N) if (x != u && x != v) {
    Rank[x] = (dist(u, x)+dist(v, x)-L)/2;
    int p = dist(u, x)-Rank[x];
    //cout<<"x="<<x<<"->"<<p<<"\n";
    pos.pb(p);
    G[p].pb(x);
  }
  sort(all(pos)); uniq(pos);
  P mp = P(INF, -1);
  //cout<<"L="<<L<<"\n";
  //for (int x : pos)cout<<x<<",";cout<<"\n";
  for (int x : pos) mp = min(mp, P(max(x, L-x), x));
  int R = mp._1, g = mp._2;
  vector<int> list = G[g];
  //for (int x : list)cout<<x<<",";cout<<"\n";
  // (size, repr)
  int maxsize = 0;
  int left = 1;
  for (int x : pos) if (x<g) left += G[x].size();
  int right = 1;
  for (int x : pos) if (x>g) right += G[x].size();
  maxsize = max(maxsize, left);
  maxsize = max(maxsize, right);
  //cout<<"Left="<<left<<", right="<<right<<"\n";
  assert(left+right+list.size()==N);
  //cout<<"sub="<<sub<<"\n";

  if (sub == 4) {
    maxsize = max(maxsize, (int)list.size());
  }
  else if (sub >= 3) {
    UF uf(N);
    for (int x : list) for (int y :list) if (same(x, y)) uf.unite(x, y);
    rep(i, N) maxsize = max(maxsize, uf.R[i]);
    //maxsize = solve(list)._1;
  }
  //cout<<"R="<<R<<", size="<<maxsize<<"\n";
  if (maxsize > N/2) R *= -1;
  return R;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:100:48: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
   for (int x : pos) if (x<g) left += G[x].size();
                                                ^
towns.cpp:102:49: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
   for (int x : pos) if (x>g) right += G[x].size();
                                                 ^
In file included from /usr/include/c++/7/cassert:44:0,
                 from towns.cpp:6:
towns.cpp:106:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   assert(left+right+list.size()==N);
          ~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 376 KB Output is correct
2 Correct 18 ms 376 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 31 ms 536 KB Output is correct
5 Correct 23 ms 596 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 612 KB Output is correct
2 Correct 16 ms 784 KB Output is correct
3 Correct 21 ms 784 KB Output is correct
4 Correct 25 ms 784 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 784 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Output isn't correct
2 Halted 0 ms 0 KB -