oj.uz

Submission #360961

# Submission time Handle Problem Language Result Execution time Memory
360961 2021-01-28T08:21:59 Z juggernaut Towns (IOI15_towns) C++14
25 / 100
 20 ms 1388 KB 
#include "towns.h"
#include <iostream>
using namespace std;
long long int n;
long long int map[500][500];
int hubDistance(int N, int sub) {
	int st=0;
	n=N;
	int b=0,ma=0;
	for(int i=0;i<n;i++)
	{
		map[0][i]=getDistance(0, i);
		if(map[0][i]>ma)
		{
			b=i;
			ma=map[0][i];
		}
	}
	int e=0;
	ma=0;
	for(int i=0;i<=n;i++)
	{
		map[b][i]=getDistance(b, i);
		if(map[b][i]>ma)
		{
			e=i;
			ma=map[b][i];
		}
	}
	for(int i=0;i<n;i++)
	{
		map[e][i]=getDistance(e, i);
	}
	long long int ans=99999999999999;
	for(int i=0;i<n;i++)
	{
		int c=map[b][i]+map[e][i]-map[b][e];
		c/=2;
		ans=min(ans,max(map[e][i]-c,map[b][i]-c));
	}
	return ans;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:16:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   16 |    ma=map[0][i];
      |       ~~~~~~~~^
towns.cpp:27:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |    ma=map[b][i];
      |       ~~~~~~~~^
towns.cpp:37:28: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   37 |   int c=map[b][i]+map[e][i]-map[b][e];
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
towns.cpp:41:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   41 |  return ans;
      |         ^~~
towns.cpp:7:6: warning: unused variable 'st' [-Wunused-variable]
    7 |  int st=0;
      |      ^~
towns.cpp:6:28: warning: unused parameter 'sub' [-Wunused-parameter]
    6 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1132 KB Output is correct
2 Correct 15 ms 1004 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 20 ms 876 KB Output is correct
5 Correct 20 ms 876 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1280 KB Output is correct
2 Correct 15 ms 1004 KB Output is correct
3 Correct 20 ms 876 KB Output is correct
4 Correct 20 ms 876 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1388 KB Output isn't correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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