oj.uz

Submission #731401

# Submission time Handle Problem Language Result Execution time Memory
731401 2023-04-27T11:47:56 Z eneskav Političari (COCI20_politicari) C++17
10 / 70
 20 ms 2536 KB 
#include <iostream>
#include <vector>
#include <cstring>
#define int long long
using namespace std;
#define fastio                        \
	ios_base::sync_with_stdio(false); \
	cin.tie(NULL);                    \
	cout.tie(NULL);
signed main()
{
	fastio;
	int n, k;
	cin >> n >> k;
	int a[n + 1][n + 1];
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			cin >> a[i][j];
	if (k <= 2)
	{
		cout << k;
		return 0;
	}
	bool vis[n + 1][n + 1];
	memset(vis, false, sizeof(vis));
	int p = 0, c = 1;
	vector<int> v;
	v.push_back(1);
	a[c][p] = 2;
	for (int i = 1; i < k * 2; ++i)
	{
		int t = c;
		c = a[c][p];
		p = t;
		if (vis[c][p])
		{
			v.pop_back();
			break;
		}
		vis[c][p] = true;
		v.push_back(c);
	}
	// print v
	/* for (auto i : v)
		cout << i << " ";
	cout << endl; */
	cout << v[(k - 1) % v.size()];
	return 0;
}

Subtask #1
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 3 ms 724 KB Output isn't correct
3 Incorrect 10 ms 1620 KB Output isn't correct
4 Incorrect 12 ms 2004 KB Output isn't correct
5 Incorrect 15 ms 2508 KB Output isn't correct
6 Incorrect 16 ms 2516 KB Output isn't correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 2 ms 468 KB Output isn't correct
9 Incorrect 4 ms 724 KB Output isn't correct
10 Incorrect 13 ms 2004 KB Output isn't correct
11 Incorrect 20 ms 2536 KB Output isn't correct
12 Incorrect 16 ms 2516 KB Output isn't correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Incorrect 2 ms 468 KB Output isn't correct