oj.uz

Submission #542595

# Submission time Handle Problem Language Result Execution time Memory
542595 2022-03-27T04:14:28 Z NhatMinh0208 Towns (IOI15_towns) C++14
25 / 100
 14 ms 1100 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
// template<typename T>
// __attribute__((always_inline)) void chkmin(T& a, const T& b) {
//     a=(a<b)?a:b;
// }

// template<typename T>
// __attribute__((always_inline)) void chkmax(T& a, const T& b) {
//     a=(a>b)?a:b;
// }
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "towns.h"

int hubDistance(int N, int sub) {
	srand(time(NULL));
	int u=0,v=0,b=0,a;
	int arr[1001];
	int brr[1001];
	for (int i=1;i<N;i++) {
		a=getDistance(0,i);
		if (a>u) {
			u=a;
			v=i;
		}
	}
	u=0;
	for (int i=0;i<N;i++) {
		arr[i]=getDistance(v,i);
		if (arr[i]>u) {
			u=arr[i];
			b=i;
		}
	}
	for (int i=0;i<N;i++) brr[i]=getDistance(b,i);
	// cout<<v<<' '<<b<<endl;
	// for (int i=0;i<N;i++) cout<<arr[i]<<' '; cout<<endl;
	// for (int i=0;i<N;i++) cout<<brr[i]<<' '; cout<<endl;
	int res=1e9;
	for (int i=0;i<N;i++) if (res>abs(arr[i]-brr[i])) {
		res=abs(arr[i]-brr[i]);
	}
	// cout<<res<<' '<<arr[b]<<endl;
	res+=arr[b]; res/=2;
	if (rand()&1) return res; else return -(res);
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:104:12: warning: conversion from 'time_t' {aka 'long int'} to 'unsigned int' may change value [-Wconversion]
  104 |  srand(time(NULL));
      |        ~~~~^~~~~~
towns.cpp:103:28: warning: unused parameter 'sub' [-Wunused-parameter]
  103 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 852 KB Output is correct
2 Correct 13 ms 852 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 13 ms 852 KB Output is correct
5 Correct 13 ms 848 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 852 KB Output is correct
2 Correct 10 ms 812 KB Output is correct
3 Correct 12 ms 832 KB Output is correct
4 Correct 13 ms 852 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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