제출 #383412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
383412		luciocf	Bitaro’s Party (JOI18_bitaro)	C++14	14 / 100	1309 ms	425572 KiB

bitaro

#include <bits/stdc++.h>

#define ff first
#define ss second

using namespace std;

typedef pair<int, int> pii;

const int maxn = 2e5+10;
const int inf = 1e9+10;

int n, m, q;
int dp[maxn];

bool mark[maxn], block[maxn];

int ptr[maxn];

vector<pii> dist[maxn];

vector<int> grafo[2][maxn], ord;

void dfs(int u)
{
	mark[u] = 1;

	for (auto v: grafo[0][u])
		if (!mark[v])
			dfs(v);

	ord.push_back(u);
}

void solve(int t)
{
	for (int i = 1; i <= n; i++)
		dp[i] = -inf;

	dp[t] = 0;
	
	for (int i = ord.size()-1; i >= 0; i--)
	{
		int u = ord[i];

		for (auto v: grafo[1][u])
			dp[u] = max(dp[u], 1 + dp[v]);
	}

}

int main(void)
{
	scanf("%d %d %d", &n, &m, &q);

	for (int i = 1; i <= m; i++)
	{
		int u, v;
		scanf("%d %d", &u, &v);

		grafo[0][v].push_back(u);
		grafo[1][u].push_back(v);
	}

	for (int i = 1; i <= n; i++)
		if (!mark[i])
			dfs(i);

	for (auto u: ord)
	{
		int s = 1;

		for (auto v: grafo[0][u])
		{
			ptr[v] = 0;
			s += dist[v].size();
		}

		s = min(s, 321);

		for (int t = 1; t <= s; t++)
		{	
			pii pp = {-1, -1};

			for (auto v: grafo[0][u])
			{
				while (dist[u].size() && ptr[v] < dist[v].size() && dist[v][ptr[v]].ss == dist[u].back().ss)
					ptr[v]++;

				if (ptr[v] < dist[v].size())
					pp = max(pp, {dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss});
			}

			if (pp.ff == -1) dist[u].push_back({0, u});
			else
			{
				dist[u].push_back(pp);

				for (auto v: grafo[0][u])
				{
					if (ptr[v] < dist[v].size() && pp == make_pair(dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss))
					{
						ptr[v]++;
						break;
					}
				}
			}
		}
	}

	while (q--)
	{
		int t, y;
		scanf("%d %d", &t, &y);

		vector<int> lista;

		for (int i = 1; i <= y; i++)
		{
			int u;
			scanf("%d", &u);

			lista.push_back(u);
			block[u] = 1;
		}

		int ans = -inf;

		if (y > 320)
		{
			solve(t);

			for (int i = 1; i <= n; i++)
				if (!block[i])
					ans = max(ans, dp[i]);
		}
		else
		{
			for (auto pp: dist[t])
			{
				if (!block[pp.ss])
				{
					ans = pp.ff;
					break;
				}
			}
		}

		if (ans < 0) printf("-1\n");
		else printf("%d\n", ans);

		for (auto u: lista)
			block[u] = 0;
	}
}

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

bitaro.cpp: In function 'int main()':
bitaro.cpp:87:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     while (dist[u].size() && ptr[v] < dist[v].size() && dist[v][ptr[v]].ss == dist[u].back().ss)
      |                              ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:90:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     if (ptr[v] < dist[v].size())
      |         ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:101:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |      if (ptr[v] < dist[v].size() && pp == make_pair(dist[v][ptr[v]].ff+1, dist[v][ptr[v]].ss))
      |          ~~~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:59:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:114:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  114 |   scanf("%d %d", &t, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:121:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  121 |    scanf("%d", &u);
      |    ~~~~~^~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 86