제출 #964379

#제출 시각아이디문제언어결과실행 시간메모리
964379raspy꿈 (IOI13_dreaming)C++14
0 / 100
41 ms14928 KiB
#include "dreaming.h"

#include <iostream>
#include <vector>
#include <queue>

#define inf 10000000

using namespace std;

vector<pair<int, int>> graf[200005];
int ob[200005];
int mx[200005];
int ixm[200005];
int zc = 0;

int dfs(int u)
{
	if (ob[u])
		return 0;
	ob[u] = 1;
	int ix = 0;
	for (auto [v, w] : graf[u])
	{
		if (!ob[v])
		{
			int tr = dfs(v)+w;
			if (tr > mx[u])
			{
				zc = mx[u];
				mx[u] = tr;
				ixm[u] = ix;
			}
			else
				zc = mx[u];
		}
		ix++;
	}
	return mx[u];
}

int getBest(int u, int trd)
{
	if (ob[u] == 2)
		return inf;
	// cout << u << " " << trd << " " << mx[u] << "\n";
	if (trd < mx[u])
		return min(getBest(graf[u][ixm[u]].first, trd+graf[u][ixm[u]].second), mx[u]);
	return trd;
}

int travelTime(int n, int m, int l, int a[], int b[], int t[])
{
	// cout << n << " " << m << "\n";
	for (int i = 0; i < m; i++)
	{
		graf[a[i]].push_back({b[i], t[i]});
		graf[b[i]].push_back({a[i], t[i]});
	}
	priority_queue<int> pq;
	for (int i = 0; i < n; i++)
		if (!ob[i])
		{
			zc = 0;
			// cout << i << " " << "test\n";
			dfs(i);
			int tr = getBest(i, zc);
			// cout << tr << "\n";
			pq.push(tr);
		}
	int rez = 0;
	if (pq.size() >= 2)
	{
		rez += pq.top() + l;
		pq.pop();
		rez += pq.top();
	}
	return rez;
}

컴파일 시 표준 에러 (stderr) 메시지

dreaming.cpp: In function 'int dfs(int)':
dreaming.cpp:23:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   23 |  for (auto [v, w] : graf[u])
      |            ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...