oj.uz

Submission #598883

# Submission time Handle Problem Language Result Execution time Memory
598883 2022-07-19T07:07:27 Z 장태환(#8458) Potemkin cycle (CEOI15_indcyc) C++17
60 / 100
 36 ms 11212 KB 
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
int num[1010];
int depth[1010];
pair<int,int> maxbe[1010][1010];
int cnt[1010];
int par[1010];
vector<int>link[1010];
bool arr[1010][1010];
vector<pair<int, int>>t;
vector<int>ue[1010], de[1010];
int c;
void dfs(int n, int p = 0, int d = 0)
{
	depth[n] = d;
	num[n] = ++c;
	par[n] = p;
	int i;
	for (i = 0; i < link[n].size(); i++)
	{
		if (link[n][i] == p)
			continue;
		if (num[link[n][i]])
		{
			if (depth[link[n][i]] < d)
			{
				if (arr[n][link[n][i]])
					continue;
				arr[n][link[n][i]] = 1;
				maxbe[n][cnt[n]++]={ depth[link[n][i]],link[n][i] };
				t.push_back({ n,link[n][i] });
			}
			else
			{
				if (arr[link[n][i]][n])
					continue;
				arr[link[n][i]][n] = 1;
				maxbe[link[n][i]][cnt[link[n][i]]]={ d,n };
				t.push_back({ link[n][i],n });
			}
		}
		else
		{
			dfs(link[n][i], n, d + 1);
		}
	}
}
int main()
{
	memset(maxbe, -10, sizeof(maxbe));
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N, M;
	cin >> N >> M;
	int i;
	for (i = 0; i < M; i++)
	{
		int a, b;
		cin >> a >> b;
		link[a].push_back(b);
		link[b].push_back(a);
	}
	for (i = 1; i <= N; i++)
	{
		if (!num[i])
		{
			dfs(i);
		}
	}
	for (i = 1; i <= N; i++)
	{
		sort(maxbe[i], maxbe[i]+cnt[i]);
	}
	for (i = 0; i < t.size(); i++)
	{
		vector<int>ans;
		int c = -1;
		while (depth[t[i].first] > depth[t[i].second])
		{
			c++;
			ans.push_back(t[i].first);
			pair<int, int>xe;
			xe.first = depth[t[i].second] + (c == 0);
			xe.second = 0;
			auto ne = lower_bound(maxbe[t[i].first], maxbe[t[i].first]+cnt[t[i].first], xe)-maxbe[t[i].first];
			if (ne != cnt[t[i].first])
			{
				t[i].first =maxbe[t[i].first][ne].second;
			}
			else
				t[i].first = par[t[i].first];
		}
		ans.push_back(t[i].second);
		if (ans.size() <= 3)
		{
			continue;
		}
		for (i = 0; i < ans.size(); i++)
			cout << ans[i] << ' ';
		return 0;
	}
	cout << "no";
}

Compilation message

indcyc.cpp: In function 'void dfs(int, int, int)':
indcyc.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for (i = 0; i < link[n].size(); i++)
      |              ~~^~~~~~~~~~~~~~~~
indcyc.cpp: In function 'int main()':
indcyc.cpp:75: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]
   75 |  for (i = 0; i < t.size(); i++)
      |              ~~^~~~~~~~~~
indcyc.cpp:99:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |   for (i = 0; i < ans.size(); i++)
      |               ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 4 ms 8276 KB Output is correct
4 Correct 3 ms 8276 KB Output is correct
5 Correct 3 ms 8276 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8404 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 8276 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8404 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 8404 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8788 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 7 ms 8788 KB Output is correct
4 Correct 6 ms 8788 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 8788 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 10656 KB Output is correct
2 Correct 10 ms 10176 KB Output is correct
3 Correct 25 ms 10584 KB Output is correct
4 Correct 11 ms 10068 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 9940 KB Expected integer, but "no" found
2 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 10916 KB Output is correct
2 Correct 36 ms 10924 KB Output is correct
3 Correct 27 ms 10704 KB Output is correct
4 Correct 26 ms 11212 KB Output is correct