836 | 2022. 01. 20 11:25:20 | kicsiboglar | Kazamata | cpp11 | Elfogadva 40/40 | 57ms | 8120 KiB |
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll n, m, i, j, act, last;
int main()
{
cin >> n;
vector <ll> x(n, 0);
vector <bool> seen(n, false);
for (i = 0; i < n; ++i) cin >> x[i];
ll db = 0;
i = 0;
while (db!=n)
{
if (act != 0)
{
if (last >= i)
{
x[i] = (x[i] + 1) % n;
}
else
{
x[i] = (x[i] + act) % n;
/*j = 1;
while (j <= act)
{
x[i] = (x[i] + 1) % n;
++j;
}*/
}
if (!seen[x[i]])
{
seen[x[i]] = true;
db++;
}
}
else if (!seen[x[i]])
{
seen[x[i]] = true;
db++;
}
if (seen[i]) ++i;
else
{
last = i;
act++;
i = 0;
}
}
cout << act;
return 0;
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Elfogadva | 0/0 | 2ms | 1736 KiB | |||
2 | Elfogadva | 0/0 | 23ms | 2752 KiB | |||
3 | Elfogadva | 2/2 | 1ms | 2104 KiB | |||
4 | Elfogadva | 2/2 | 1ms | 2108 KiB | |||
5 | Elfogadva | 2/2 | 1ms | 2108 KiB | |||
6 | Elfogadva | 2/2 | 1ms | 2116 KiB | |||
7 | Elfogadva | 2/2 | 1ms | 2128 KiB | |||
8 | Elfogadva | 2/2 | 1ms | 2132 KiB | |||
9 | Elfogadva | 2/2 | 1ms | 2140 KiB | |||
10 | Elfogadva | 2/2 | 1ms | 2140 KiB | |||
11 | Elfogadva | 2/2 | 43ms | 4024 KiB | |||
12 | Elfogadva | 2/2 | 45ms | 4600 KiB | |||
13 | Elfogadva | 2/2 | 45ms | 5160 KiB | |||
14 | Elfogadva | 2/2 | 57ms | 5812 KiB | |||
15 | Elfogadva | 2/2 | 43ms | 6284 KiB | |||
16 | Elfogadva | 2/2 | 43ms | 6836 KiB | |||
17 | Elfogadva | 2/2 | 39ms | 7384 KiB | |||
18 | Elfogadva | 2/2 | 43ms | 7948 KiB | |||
19 | Elfogadva | 2/2 | 41ms | 8112 KiB | |||
20 | Elfogadva | 2/2 | 48ms | 8116 KiB | |||
21 | Elfogadva | 2/2 | 48ms | 8116 KiB | |||
22 | Elfogadva | 2/2 | 46ms | 8120 KiB |