oj.uz

Submission #889941

# Submission time Handle Problem Language Result Execution time Memory
889941 2023-12-20T10:05:54 Z abcvuitunggio Towns (IOI15_towns) C++17
25 / 100
 17 ms 532 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int dist[111][111],C[111];
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];
    return dist[u][v]=getDistance(u,v);
}
int hubDistance(int N, int sub){
    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});
    int u=mx.second;
    mx={0,-1};
    for (int i=0;i<N;i++)
        mx=max(mx,{d(u,i),i});
    int v=mx.second;
	int R=1e9,cnt[2]={0,0};
	for (int i=0;i<N;i++)
        R=min(R,abs(d(i,u)-d(i,v)));
    R=(R+d(u,v))/2;
    vector <int> a,b,tmp;
    for (int i=0;i<N;i++){
        int val=d(i,u)-d(i,v);
        if (val<-R)
            cnt[0]++;
        if (val==-R)
            a.push_back(i);
        if (val==R)
            b.push_back(i);
        if (val>R)
            cnt[1]++;
    }
    if (max(cnt[0],cnt[1])>N/2)
        return -R;
   	return (max(a.size(),b.size())>N/2?-R:R);
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:40:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   40 |     if (max(cnt[0],cnt[1])>N/2)
      |     ^~
towns.cpp:42:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   42 |     return (max(a.size(),b.size())>N/2?-R:R);
      |     ^~~~~~
towns.cpp:42:35: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   42 |     return (max(a.size(),b.size())>N/2?-R:R);
      |             ~~~~~~~~~~~~~~~~~~~~~~^~~~
towns.cpp:14:28: warning: unused parameter 'sub' [-Wunused-parameter]
   14 | int hubDistance(int N, int sub){
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 12 ms 348 KB Output is correct
5 Correct 17 ms 532 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 11 ms 348 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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