oj.uz

Submission #1030252

# Submission time Handle Problem Language Result Execution time Memory
1030252 2024-07-22T00:43:44 Z 12345678 Towns (IOI15_towns) C++17
35 / 100
 10 ms 944 KB 
#include "towns.h"
#include <bits/stdc++.h>

using namespace std;

int hubDistance(int N, int sub) {
	pair<int, int> mx={0, 0};
	int l=0, r, mn=INT_MAX;
	vector<int> dl(N), dr(N);
	for (int i=1; i<N;i ++) dl[i]=getDistance(0, i), mx=max(mx, {dl[i], i});
	r=mx.second;
	dr[l]=dl[r];
	for (int i=0; i<N;i ++) if (i!=l&&i!=r) dr[i]=getDistance(r, i);
	int dist=dl[r];
	map<int, int> mp;
	map<int, vector<int>> mpd;
	for (int i=0; i<N; i++)
	{
		int x=dl[i], y=dr[i], h=(x+dist-y)/2, dh=(x+y-dist)/2;
		if (mp.find(h)==mp.end()) mp[h]=dh;
		else mp[h]=max(mp[h], dh);
		mpd[h].push_back(i);
	}	
	for (auto [x, a]:mp)
	{
		int mx=a;
		for (auto [y, b]:mp) mx=max(mx, abs(x-y)+b);
		mn=min(mn, mx); 
	}
	int sz=0, can=-1;
	for (auto [x, a]:mp)
	{
		int mx=a;
		for (auto [y, b]:mp) mx=max(mx, abs(x-y)+b);
		if (mn==mx) if (sz<=(N/2)&&((int)mpd[x].size()-1)<=(N/2)&&(N-sz-(int)mpd[x].size())<=(N/2)) can=1;
		sz+=mpd[x].size();
	}
	return mn*can;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:26:7: warning: declaration of 'mx' shadows a previous local [-Wshadow]
   26 |   int mx=a;
      |       ^~
towns.cpp:7:17: note: shadowed declaration is here
    7 |  pair<int, int> mx={0, 0};
      |                 ^~
towns.cpp:33:7: warning: declaration of 'mx' shadows a previous local [-Wshadow]
   33 |   int mx=a;
      |       ^~
towns.cpp:7:17: note: shadowed declaration is here
    7 |  pair<int, int> mx={0, 0};
      |                 ^~
towns.cpp:36:19: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   36 |   sz+=mpd[x].size();
      |                   ^
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 9 ms 860 KB Output is correct
2 Correct 7 ms 944 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 9 ms 860 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 9 ms 860 KB Output is correct
4 Correct 10 ms 860 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 448 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 9 ms 348 KB Output is correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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