oj.uz

Submission #492056

# Submission time Handle Problem Language Result Execution time Memory
492056 2021-12-05T11:06:42 Z nick_kcin Dreaming (IOI13_dreaming) C++14
0 / 100
 1000 ms 19676 KB 
#include "dreaming.h"
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
#define MAXN ((int)1e5 + 5)
#define INF ((int)1e9 + 5)

struct Node
{
	vector<int> ne;
	vector<int> nw;
	int treenum;
	int maxp;    // maximum path
};
int trnum;
Node g[MAXN];
bool marca[MAXN];

void dfs0(int n, int p)
{
	marca[n] = true;
	g[n].treenum = trnum;
	for (int nxt : g[n].ne)
		if (nxt != p)
			dfs0(nxt, n);
}

int trval[MAXN];
int trhead[MAXN];
void dfs1(int n, int p)
{
	if (g[n].ne.size() == 0)
	{
		trval[g[n].treenum] = 0;
		return;
	}

	if (p != -1 && g[n].ne.size() == 1)
	{
		g[n].maxp = 0;
		return;
	}

	int pmax = 0;
	for (int i = 0; i < g[n].ne.size(); i++)
	{
		int nxt = g[n].ne[i];
		if (nxt == p)
			continue;
		int nwe = g[n].nw[i];
		dfs1(nxt, n);
		pmax = max(pmax, nwe + g[nxt].maxp);
	}
	g[n].maxp = pmax;
}

map<int, int> trm;    // tree map, trval and trinx
int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
	for (int i = 0; i < M; i++)
	{
		int a = A[i];
		int b = B[i];
		int w = T[i];
		g[a].ne.push_back(b);
		g[a].nw.push_back(w);
		g[b].ne.push_back(a);
		g[b].nw.push_back(w);
	}

	trnum = 0;
	for (int i = 0; i < N; i++)
	{
		if (!marca[i])
		{
			dfs0(i, -1);
			trnum++;
		}
	}

	fill(trval, trval + trnum, INF);
	for (int i = 0; i < N; i++)
	{
		int tn = g[i].treenum;
		dfs1(i, -1);
		if(g[i].maxp < trval[tn])
		{
			trval[tn] = g[i].maxp;
			trhead[tn] = T[i];
		}
	}

	// for (int i = 0; i < trnum; i++)
	// {
	// 	fprintf(stderr, "D: tr %d,  peso = %d\n", i, trval[i]);
	// }

	if (trnum == 1)
		return trval[0];
	else if (trnum == 2)
		return trval[0] + trval[1] + L;

	int ok = INF;
	for (int i = 0; i < trnum; i++)
	{
		trm[trval[i]] = i;
	}
	for (int i = 0; i < trnum; i++)
	{
		// i root
		trm.erase(trval[i]);
		auto it = trm.end();
		it--;
		int nvalr = it->first + trval[i] + L;
		int nval2 = it->first;
		it--;
		nval2 += it->first;
		nval2 += 2*L + trhead[i];
		ok = min(ok, max(nval2, nvalr));
		// fprintf(stderr, "WHEN root %d: r = %d, 2 = %d\n", i, nvalr, nval2);
		trm[trval[i]] = i;
	}

	return ok;
}

Compilation message

dreaming.cpp: In function 'void dfs1(int, int)':
dreaming.cpp:47:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |  for (int i = 0; i < g[n].ne.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 19676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 19676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 10508 KB Output is correct
2 Correct 53 ms 10736 KB Output is correct
3 Correct 41 ms 10608 KB Output is correct
4 Incorrect 40 ms 10540 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 19676 KB Time limit exceeded
2 Halted 0 ms 0 KB -