oj.uz

Submission #789991

# Submission time Handle Problem Language Result Execution time Memory
789991 2023-07-22T08:46:01 Z Amylopectin Towns (IOI15_towns) C++14
0 / 100
 28 ms 904 KB 
#include "towns.h"
#include <vector>
#include <algorithm>
using namespace std;
const int mxn = 210;
// struct we
// {
// 	int val,no;
// };
// struct patt
// {
// 	int to,diss;
// };
// bool cmp(const struct we &l,const struct we &r)
// {
// 	return l.val < r.val;
// }
// struct we sot[mxn] = {};
// vector<int> noo[mxn] = {};
// vector<struct patt> pat[mxn] = {};
int dis[mxn][mxn] = {},bot[mxn] = {},ru = 1,disd[mxn] = {};
int fima(int l,int r)
{
	if(l > r)
	{
		return l;
	}
	return r;
}
int fimi(int l,int r)
{
	if(l < r)
	{
		return l;
	}
	return r;
}
// int re(int cn,int tohe)
// {
// 	int i,j,fn,fm,be = 0;
// 	if(noo[cn].size() == 1)
// 	{
// 		bot[cn] = noo[cn][0];
// 		return 0;
// 	}
// 	bot[cn] = noo[cn][0];
// 	for(i=1; i<noo[cn].size(); i++)
// 	{
// 		fn = noo[cn][i];
// 		sot[i-1] = {(dis[0][bot[cn]] + dis[bot[cn]][fn] - dis[0][fn])/2,fn};
// 	}
// 	sort(sot,sot+noo[cn].size()-1,cmp);
// 	for(i=1; i<noo[cn].size()-1; i++)
// 	{
// 		if(sot[i-1].val != sot[i].val)
// 		{
// 			disd[ru] = dis[0][bot[cn]] - sot[i-1].val;
// 			pat[cn].push_back({ru,disd[ru] - disd[cn]});
// 			for(j=be; j<i; j++)
// 			{
// 				noo[ru].push_back(sot[j].no);
// 			}
// 			ru++;
// 			be = i;
// 		}
// 	}
// 	pat[cn].push_back({ru,disd[ru] - disd[cn]});
// 	disd[ru] = dis[0][bot[cn]] - sot[i-1].val;
// 	for(j=be; j<i; j++)
// 	{			
// 		noo[ru].push_back(sot[j].no);
// 	}
// 	ru++;
// 	be = i;
// 	return 0;
// }
int hubDistance(int n, int sub) 
{
	int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
	for(i=0; i<n; i++)
	{
		for(j=i+1; j<n; j++)
		{
			dis[i][j] = getDistance(i,j);
			dis[j][i] = dis[i][j];
			ami = fima(ami,dis[i][j]);
		}
		// if(i>0)
		// 	noo[0].push_back(i);
	}
	for(i=1; i<n; i++)
	{
		for(j=i+1; j<n; j++)
		{
			cma = 0;
			for(k=1; k<n; k++)
			{
				if(k == i || k == j)
				{
					continue;
				}
				cma = fima(cma,(dis[0][k] + dis[i][k] - dis[0][i])/2);
				cma = fima(cma,(dis[0][k] + dis[j][k] - dis[0][j])/2);
			}
			ami = fimi(ami,cma);
		}
	}
	return ami;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:79:12: warning: unused variable 'm' [-Wunused-variable]
   79 |  int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
      |            ^
towns.cpp:79:14: warning: unused variable 'cn' [-Wunused-variable]
   79 |  int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
      |              ^~
towns.cpp:79:17: warning: unused variable 'cm' [-Wunused-variable]
   79 |  int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
      |                 ^~
towns.cpp:79:20: warning: unused variable 'fn' [-Wunused-variable]
   79 |  int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
      |                    ^~
towns.cpp:79:23: warning: unused variable 'fm' [-Wunused-variable]
   79 |  int i,j,k,m,cn,cm,fn,fm,cma,ami = 0;
      |                       ^~
towns.cpp:77:28: warning: unused parameter 'sub' [-Wunused-parameter]
   77 | int hubDistance(int n, int sub)
      |                        ~~~~^~~

Subtask #1
0 / 13.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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