oj.uz

Submission #891952

# Submission time Handle Problem Language Result Execution time Memory
891952 2023-12-24T13:49:28 Z abcvuitunggio Towns (IOI15_towns) C++17
13 / 100
 12 ms 544 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int n,dist[111][111],u,v,R,sz[2],p[111],cnt;
int d(int u, int v){
    if (u==v)
        return 0;
    if (u>v)
        swap(u,v);
    if (dist[u][v])
        return dist[u][v];
    cnt++;
    return dist[u][v]=getDistance(u,v);
}
int f(int i){
    return (p[i]==i?i:p[i]=f(p[i]));
}
void unite(int i, int j){
    p[f(j)]=f(i);
}
int calc(int i){
    return d(i,u)-d(i,0)+d(0,u);
}
bool check(int i, int j){
    return (d(0,i)+d(0,j)-d(i,j)>calc(i));
}
int find_majority(vector <int> a){
    if (a.empty())
        return -1;
    if (a.size()==1)
        return a[0];
    vector <int> ve;
    for (int i=0;i<a.size();i+=2)
        if (check(a[i],a[i+1])){
            unite(a[i],a[i+1]);
            ve.push_back(a[i]);
        }
    return find_majority(ve);
}
int check(int i){
    vector <int> ve;
    for (int j=1;j<=n;j++)
        if (calc(j)==i)
            ve.push_back(j);
    iota(p,p+n,0);
    int w=find_majority(ve),cnt=0;
    if (w==-1)
        return 1;
    for (int i:ve)
        if (i!=w&&i==f(i))
            if (check(w,i))
                unite(w,i);
    for (int i:ve)
        cnt+=(f(i)==w);
    return 1-(cnt>n/2)*2;
}
int hubDistance(int N, int sub){
    cnt=0;
    n=N;
    memset(dist,0,sizeof(dist));
    pair <int, int> mx={0,-1};
    for (int i=0;i<n;i++)
        mx=max(mx,{d(0,i),i});
    u=mx.second;
    mx={0,-1};
    for (int i=0;i<n;i++)
        mx=max(mx,{d(u,i),i});
    v=mx.second,R=1e9,sz[0]=sz[1]=0;
    vector <int> ve;
	for (int i=0;i<n;i++){
        ve.push_back(calc(i));
        R=min(R,abs(d(u,v)-calc(i)));
	}
    sort(ve.begin(),ve.end());
    int ch=-1;
    for (int i:{d(u,v)-R,d(u,v)+R})
        if (abs(d(u,v)-i)==R&&(i==ve[n/2]||i==ve[(n-1)/2]))
            ch=max(ch,check(i));
    return (R+d(u,v))/2*ch;
}

Compilation message

towns.cpp: In function 'int d(int, int)':
towns.cpp:5:18: warning: declaration of 'v' shadows a global declaration [-Wshadow]
    5 | int d(int u, int v){
      |              ~~~~^
towns.cpp:4:24: note: shadowed declaration is here
    4 | int n,dist[111][111],u,v,R,sz[2],p[111],cnt;
      |                        ^
towns.cpp:5:11: warning: declaration of 'u' shadows a global declaration [-Wshadow]
    5 | int d(int u, int v){
      |       ~~~~^
towns.cpp:4:22: note: shadowed declaration is here
    4 | int n,dist[111][111],u,v,R,sz[2],p[111],cnt;
      |                      ^
towns.cpp: In function 'int find_majority(std::vector<int>)':
towns.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i=0;i<a.size();i+=2)
      |                  ~^~~~~~~~~
towns.cpp: In function 'int check(int)':
towns.cpp:46:29: warning: declaration of 'cnt' shadows a global declaration [-Wshadow]
   46 |     int w=find_majority(ve),cnt=0;
      |                             ^~~
towns.cpp:4:41: note: shadowed declaration is here
    4 | int n,dist[111][111],u,v,R,sz[2],p[111],cnt;
      |                                         ^~~
towns.cpp:49:14: warning: declaration of 'int i' shadows a parameter [-Wshadow]
   49 |     for (int i:ve)
      |              ^
towns.cpp:40:15: note: shadowed declaration is here
   40 | int check(int i){
      |           ~~~~^
towns.cpp:53:14: warning: declaration of 'int i' shadows a parameter [-Wshadow]
   53 |     for (int i:ve)
      |              ^
towns.cpp:40:15: note: shadowed declaration is here
   40 | int check(int i){
      |           ~~~~^
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:57:28: warning: unused parameter 'sub' [-Wunused-parameter]
   57 | int hubDistance(int N, int sub){
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB Output is correct
2 Correct 8 ms 532 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 12 ms 544 KB Output is correct
5 Correct 12 ms 348 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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