oj.uz

Submission #598898

# Submission time Handle Problem Language Result Execution time Memory
598898 2022-07-19T07:22:18 Z 장태환(#8458) Potemkin cycle (CEOI15_indcyc) C++17
50 / 100
 1000 ms 18964 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;
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()
{
	srand(time(NULL));
	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);
	}
	int T = 100;
	while (T--)
	{
		memset(arr, 0, sizeof(arr));
		memset(num, 0, sizeof(num));
		memset(depth, 0, sizeof(depth));
		memset(maxbe, -10, sizeof(maxbe));
		memset(cnt, 0, sizeof(cnt));
		t.clear();
		memset(par, 0, sizeof(par));
		c = 0;
		for (i = 1; i <= N; i++)
		{
			random_shuffle(link[i].begin(), link[i].end());
		}
		vector<int>od;
		for (i = 1; i <= N; i++)
		{
			od.push_back(i);
		}
		random_shuffle(od.begin(), od.end());
		for (i = 1; i <= N; i++)
		{
			if (!num[od[i]])
			{
				dfs(od[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:19:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (i = 0; i < link[n].size(); i++)
      |              ~~^~~~~~~~~~~~~~~~
indcyc.cpp: In function 'int main()':
indcyc.cpp:95: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]
   95 |   for (i = 0; i < t.size(); i++)
      |               ~~^~~~~~~~~~
indcyc.cpp:119:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |    for (i = 0; i < ans.size(); i++)
      |                ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9300 KB Output is correct
2 Correct 85 ms 9324 KB Output is correct
3 Correct 85 ms 9328 KB Output is correct
4 Correct 80 ms 9320 KB Output is correct
5 Correct 94 ms 9324 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9300 KB Output is correct
2 Correct 81 ms 9324 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9300 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 9464 KB Output is correct
2 Runtime error 14 ms 18964 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 9344 KB Output is correct
2 Correct 139 ms 9460 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10584 KB Output is correct
2 Correct 10 ms 10020 KB Output is correct
3 Execution timed out 1078 ms 10588 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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