oj.uz

Submission #152288

# Submission time Handle Problem Language Result Execution time Memory
152288 2019-09-07T03:30:21 Z tinjyu Towns (IOI15_towns) C++14
25 / 100
 22 ms 1480 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 to 'int' from 'long long int' may alter its value [-Wconversion]
    ma=map[0][i];
       ~~~~~~~~^
towns.cpp:27:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
    ma=map[b][i];
       ~~~~~~~~^
towns.cpp:37:28: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   int c=map[b][i]+map[e][i]-map[b][e];
         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
towns.cpp:41:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return ans;
         ^~~
towns.cpp:7:6: warning: unused variable 'st' [-Wunused-variable]
  int st=0;
      ^~
towns.cpp:6:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int N, int sub) {
                            ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1272 KB Output is correct
2 Correct 16 ms 992 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 21 ms 932 KB Output is correct
5 Correct 21 ms 888 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1144 KB Output is correct
2 Correct 16 ms 1016 KB Output is correct
3 Correct 21 ms 1016 KB Output is correct
4 Correct 21 ms 888 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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