oj.uz

Submission #30729

# Submission time Handle Problem Language Result Execution time Memory
30729 2017-07-26T10:29:46 Z rondojim Towns (IOI15_towns) C++14
35 / 100
 193 ms 25548 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std ;
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define vii vector<ii> 
 
int from[105] , to[105] , dist[105][105] ;
vii len[1000010] ;
 
int hubDistance(int n, int sub) {
	memset(dist , -1 , sizeof dist) ;
	int mdist = -1 , opt = -1 , tmp ; 
	for(int i=0;i<n;i++){
		tmp = getDistance(0 , i) ;
		if(mdist < tmp){
			mdist = tmp ;
			opt = i ;
		}
	}
	mdist = -1 ;
	int nxt = -1 ;
	for(int i=0;i<n;i++){
		from[i] = getDistance(opt , i) ;
		if(from[i] > mdist){
			mdist = from[i] ;
			nxt = i;
		}
	}
	for(int i=0;i<n;i++) to[i] = getDistance(nxt , i ) ;
	for(int i=1;i<=1000000;i++) len[i].clear() ;
	int res = 1e9 ; 
	for(int i=0;i<n;i++){
		if(i == nxt ||i == opt) continue ;
		int ok = (from[i] + to[i] - mdist)/2 ;
		int ln = from[i] - ok ; 
		len[ln].push_back({i , ok }) ;
		res = min(res , max( mdist - ln , ln ) ) ;
	}
	if(sub <= 2) return res ;
 
	if(sub == 4){
		int sum = 1 ;
		bool chk = 0 ;
		for(int i=1;i<=mdist;i++){
			if(len[i].empty()) continue ;
			if(max(i , mdist - i) == res) {
				if( (int)len[i].size() <= n/2 && sum<=n/2 && n - sum - (int)len[i].size() <= n/2 ) chk = 1 ;
			}
			sum += (int)len[i].size() ;
		}
		if(chk ) return res ;
		else return -res  ;
	}
 
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 25548 KB Output is correct
2 Correct 106 ms 25548 KB Output is correct
3 Correct 6 ms 25548 KB Output is correct
4 Correct 99 ms 25548 KB Output is correct
5 Correct 106 ms 25548 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 25548 KB Output is correct
2 Correct 103 ms 25548 KB Output is correct
3 Correct 109 ms 25548 KB Output is correct
4 Correct 113 ms 25548 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 113 ms 25548 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 193 ms 25548 KB Output is correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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