solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sz;
cin >> sz;
vector<int> minutes(sz);
for (int i = 0; i < sz; i++) {
cin >> minutes[i];
}
int res = 0;
for (int i = 0; i < sz; i++) {
if (i == 0) {
if (minutes[i] - 1 >= 15) {
res += 15;
break;
} else {
res += minutes[i];
}
if (i == sz - 1) {
res += 15;
}
} else {
if (minutes[i] - minutes[i - 1] - 1 >= 15) {
res += 15;
break;
} else {
res += minutes[i] - minutes[i - 1];
}
if (i == sz - 1) {
res += 15;
}
}
}
cout << min(res, 90) << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& fout, const vector<T>& vec) {
for (const auto& el : vec) {
fout << el << ' ';
}
return fout;
}
template <class T>
istream& operator>>(istream& fin, vector<T>& vec) {
for (size_t i = 0; i < vec.size(); ++i) {
cin >> vec[i];
}
return fin;
}
int Solve() {
int n;
cin >> n;
vector<int> in(n);
cin >> in;
sort(in.begin(), in.end());
in.push_back(90);
int prev = 0;
for (int i = 0; i <= n; ++i) {
if (in[i] - prev > 15) {
cout << prev + 15 << '\n';
return 0;
}
prev = in[i];
}
cout << 90 << '\n';
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
Solve();
return 0;
}
| 7 | CPP |
n = int(input())
a = 15
s = list(map(int,input().strip().split(' ')))
last = 0
for i in range(n):
if(((s[i])- last ) <= a):
last = s[i]
else:
break
if(last >= 75):
print(90)
else:
print(last+15) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T power(T N, T P) {
return (P == 0) ? 1 : N * power(N, P - 1);
}
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
int main() {
int n, j, Arr[100], ans;
scanf("%d", &n);
;
for (j = 0; j < n; j++) scanf("%d", &Arr[j]);
if (Arr[0] >= 16) {
ans = 15;
} else {
Arr[n] = 120;
for (j = 0; j < n; j++) {
if ((Arr[j + 1] - 15) > Arr[j]) {
ans = Arr[j] + 15;
break;
}
}
}
if (ans > 90) ans = 90;
printf("%d\n", ans);
return 0;
}
| 7 | CPP |
#----Kuzlyaev-Nikita-Codeforces-----
#------------02.04.2020-------------
alph="abcdefghijklmnopqrstuvwxyz"
#-----------------------------------
n=int(input())
t=list(map(int,input().split()))
s=0
for i in range(90):
if t.count(i+1)==0:
s+=1
else:
s=0
if s==15:
print(i+1)
break
else:
print(90) | 7 | PYTHON3 |
n=int(input())
li = list(map(int,input().split()))
if li[0] > 15: print('15');quit()
if li[0] <= 15 and n == 1:print(li[0]+15);quit()
for i in range(1,n):
if li[i] - li [i-1] > 15 : print(li[i-1]+15);break
else:
if 90 - li[-1] <= 15 and i == n-1: print('90')
elif li[-1] == 90 and i==n-1:print('90')
elif 90-li[-1] > 15 and i==n-1: print(li[-1]+15)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
flag=0
j=0
c=0
for i in l:
if i-j-1<15:
c=i
else:
c=j+15
flag=1
break
j=i
if flag==1:
print(c)
else:
if i<=75:
print(i+15)
else:
print(90)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
ans = 0
if len(a) == 0:
ans = 0
elif len(a) == 1:
if a[0] >= 16:
ans = 15
else:
ans = a[0] + 15
else:
if a[0] >= 16:
ans = 15
else:
for i in range(1, len(a)):
if a[i] - a[i-1] >= 16:
ans = a[i-1] + 15
break
if ans == 0:
ans = a[-1] + 15
if ans == 0 or ans > 90:
ans = 90
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
double safe_sqrt(double x) { return sqrt(max((double)0.0, x)); }
long long GI(long long& x) { return scanf("%lld", &x); }
long long n, a[99];
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
cout << (fixed) << setprecision(9);
while (GI(n) == 1) {
for (long long i = (1), _b = (n); i <= _b; ++i) GI(a[i]);
a[n + 1] = 1000;
for (long long i = (0), _b = (n); i <= _b; ++i)
if (a[i] + 15 < a[i + 1]) {
cout << min(a[i] + 15, 90LL) << endl;
break;
}
}
}
| 7 | CPP |
n=input()
arr=[int(i) for i in input().split()]
i=0
flag=0
if arr[0]>15:
print("15")
exit(0)
elif int(n)==1:
print(arr[0]+15)
exit(0)
else:
while int(i)!=(int(n)-1):
if (arr[i+1]-arr[i])>15:
print(arr[i]+15)
flag=1
break
i=int(i)+1
if (90-arr[int(n)-1])>15 and int(n)!=1 and int(flag)!=1:
print(arr[int(n)-1]+15)
exit(0)
if int(i)==int(n)-1 and int(n)!=1 and int(flag)!=1:
print("90") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
bool flag = true;
int n;
int curr = 0;
int diff;
int sum = 0;
int num;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
if (num - curr <= 15 && flag) {
curr = num;
sum = curr;
} else if (flag) {
sum += 15;
flag = false;
}
}
if (90 - sum <= 15 && flag)
sum = 90;
else if (n == 1 && num <= 15)
sum += 15;
if (sum == num && num < 90) {
if (num + 15 <= 90)
sum += 15;
else
sum = 90;
}
cout << sum;
}
| 7 | CPP |
import sys
number_of_minutes = int(input())
time_range = input()
minutes = time_range.split()
tmp = 0
for i in range(number_of_minutes):
if int(tmp)+15 < int(minutes[i]):
print(str(int(tmp)+15))
sys.exit()
tmp = minutes[i]
#print("tmp la : " + str(tmp))
if int(tmp)+15>90:
print("90")
else:
print(str(int(tmp)+15)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] > 15)
cout << 15 << endl;
else
for (int i = 0; i < n; i++) {
if (a[i] - a[i - 1] > 15) {
cout << a[i - 1] + 15 << endl;
break;
} else if (i == n - 1 && a[n - 1] <= 75)
cout << a[i] + 15 << endl;
else if (i == n - 1 && a[n - 1] > 75)
cout << 90 << endl;
}
return 0;
}
| 7 | CPP |
def main():
input()
t = [int(_) for _ in input().split()] + [90]
end = 0
still_interesting = True
next_interesting = 0
while end < 90 and still_interesting:
end = min(end + 15, 90)
if end >= t[next_interesting]:
end = t[next_interesting]
next_interesting += 1
else:
still_interesting = False
print(end)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
n = int(input())
A = list(map(int, input().split()))
t = 0
for i in range(n):
if t + 15 < A[i]:
print(t + 15)
exit()
else:
t = A[i]
print(min(90, t + 15)) | 7 | PYTHON3 |
def readInts(): return map(int, input().split())
n = int(input())
good = [False]*90
for i in readInts():
good[i-1] = True
ans = 0
badCnt = 0
for g in good:
ans += 1
if g: badCnt = 0
else:
badCnt += 1
if badCnt == 15:
break
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, x, i, min = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &x);
min += 15;
if (min >= x)
min = x;
else
break;
}
if (i == n) min += 15;
if (min >= 90)
printf("90\n");
else
printf("%d\n", min);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, A[100];
cin >> n;
int aux = 0, ans = 15;
while (n--) {
int t;
cin >> t;
if (t <= ans)
ans = t + 15;
else
break;
}
if (ans > 90) ans = 90;
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
l = [0] + list(map(int, input().split()))
i = 1
curr = 0
while i != n + 1 and l[i] - curr <= 15:
curr = l[i]
i += 1
print(min(90, l[i - 1] + 15)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m;
cin >> n;
j = 0;
bool tr = false;
int a[100];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) {
if ((a[i] - j) > 15) {
tr = true;
m = j;
break;
i = i + n;
} else
j = a[i];
}
if (tr)
cout << m + 15;
else {
if (((a[n - 1]) + 15) < 90)
cout << a[n - 1] + 15;
else
cout << 90;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n + 5];
a[0] = 0;
for (int i = 1; i <= n; i++) cin >> a[i];
a[n + 1] = 90;
int ans = 0;
for (int i = 1; i <= (n + 1); i++) {
if ((a[i] - a[i - 1]) > 15) {
ans = ans + 15;
break;
}
ans = ans + a[i] - a[i - 1];
}
cout << ans;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
a.insert(0, 0)
a.append(90)
n += 2
t = a[0] + 15
for i in range(1, n):
if a[i] > t:
break
else:
t = a[i] + 15
if t > 90:
print(90)
else:
print(t) | 7 | PYTHON3 |
n = int(input()) + 2
a = [0]
a.extend(list(map(int, input().split())))
a.append(90)
ans = 0
for i in range(1, n):
if a[i] - a[i - 1] > 15:
ans += 15
break
else:
ans = a[i]
print(ans) | 7 | PYTHON3 |
n = int(input())
a = sorted(list(map(int,input().split())))
a.insert(0,0)
a .append(90)
z =0
for i in range(1,n+2):
if a[i]-a[i-1]>15:
print(a[i-1]+15)
z =1
break
if z!=1:
print(90) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split(' ')))
last = 0
end = False
for i in arr:
if i - last > 15:
print(last + 15)
end = True
break
last = i
if not end:
if last > 74:
print(90)
else:
print(last + 15) | 7 | PYTHON3 |
n = int(input())
t = list(map(int,input().split()))
t_0 = 0
for i in range(0,n):
if (t[i] > t_0 + 15):
print(int(t_0+15))
exit()
else:
t_0 = t[i]
if t_0 + 15 < 90:
print(t_0+15)
else:
print('90')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
int atual = 0;
bool aux = false;
for (int i = 0; i < n; i++) {
cin >> x;
if (!aux && x <= atual + 15)
atual = x;
else if (!aux) {
atual += 15;
aux = true;
}
}
if (!aux)
cout << min(90, atual + 15) << '\n';
else
cout << atual << '\n';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long i, j, n, pos, ans, a[100];
while (cin >> n) {
for (i = 0; i < n; i++) {
cin >> a[i];
}
bool f = 0;
if (a[0] > 15)
ans = 15;
else {
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] > 15) {
pos = i - 1;
f = 1;
break;
}
}
if (f == 1)
ans = a[pos] + 15;
else
ans = a[n - 1] + 15;
}
if (ans > 90)
cout << 90 << endl;
else
cout << ans << endl;
}
}
| 7 | CPP |
n=int(input())
l=[0]+list(map(int,input().split()))+[900]
ans=90
for i in range(1,n+2):
if l[i]-l[i-1]>15: ans=l[i-1]+15; break
print(min(90,ans))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t[n];
t[0] = 0;
for (int i = 1; i <= n; i++) cin >> t[i];
for (int i = 1; i <= n; i++)
if (t[i] - t[i - 1] <= 15) {
if (i == n) {
if (t[i] >= 75)
cout << 90 << endl;
else
cout << t[i] + 15 << endl;
} else
continue;
} else {
cout << t[i - 1] + 15;
break;
}
}
| 7 | CPP |
import sys
sys.stderr = sys.stdout
def interesting(n, T):
k = 0
t0 = 0
for t in T:
if t > t0 + 15:
return t0 + 15
t0 = t
if 90 > t0 + 15:
return t0 + 15
return 90
def main():
n = readint()
T = readintl()
print(interesting(n, T))
##########
def readint():
return int(input())
def readinti():
return map(int, input().split())
def readintt():
return tuple(readinti())
def readintl():
return list(readinti())
def readinttl(k):
return [readintt() for _ in range(k)]
def readintll(k):
return [readintl() for _ in range(k)]
def log(*args, **kwargs):
print(*args, **kwargs, file=sys.__stderr__)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[100];
int main() {
int curr, n;
cin >> n;
curr = 15;
for (int i = 0; i < n; i++) cin >> arr[i];
int i = 0;
while (i < n) {
if (arr[i] > curr) break;
while (i < n && arr[i] <= curr) i++;
i--;
curr = arr[i] + 15;
i++;
}
int ans = min(curr, 90);
cout << ans;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
char match[91];
for (int i = 0; i <= 90; ++i) match[i] = 0;
int totalGood;
cin >> totalGood;
for (int i = 1; i <= totalGood; ++i) {
int cur;
cin >> cur;
match[cur] = 1;
}
int last = 0;
for (int i = 1; i <= 90; ++i) {
if (match[i]) {
last = i;
continue;
}
if (i - last == 15) {
cout << i << endl;
return 0;
}
}
cout << 90 << endl;
return 0;
}
| 7 | CPP |
n = int(input())
t = list(map(int,input().split()))
t.insert(0,0)
k = [15+t[i] for i in range(n) if t[i+1]-t[i]>15]
if len(k)==0: print(min(90,t[-1]+15))
else: print(k[0]) | 7 | PYTHON3 |
# n = int(input())
# tn = [int(i) for i in input().split()]
# def f(m):
# m = 0
# l = 0
# r = n
# while l < r:
# m = (l + r)//2
# в ряду всего m парт и m*2 мест
# первое место в ряду p равно 2m(p-1) + 1
n = int(input())
minutes = [int(i) for i in input().split()]
minutes.insert(0, 0)
minutes.append(90)
# if minutes[0] > 15:
# print(15)
# exit()
# else: amount += minutes[0]
for i in range(n + 1):
if abs(minutes[i] - minutes[i+1]) > 15:
print(15 + minutes[i])
exit()
print(90) | 7 | PYTHON3 |
n = int(input())
str_ms = str(input())
ms = str_ms.split(' ')
if int(ms[0]) - 0 > 15:
print(15)
else:
for i in range(len(ms)):
if i == len(ms) - 1:
check = int(ms[i]) + 15
if check >= 90:
print(90)
else:
print(check)
break
check = int(ms[i + 1]) - int(ms[i])
if check > 15:
print(int(ms[i]) + 15)
break | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, tmp, expectedNext = 15;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp <= expectedNext) {
expectedNext = tmp += 15;
} else {
break;
}
}
if (expectedNext > 90) {
expectedNext = 90;
}
cout << expectedNext;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T max2(T a, T b) {
return a < b ? b : a;
}
template <class T>
T min2(T a, T b) {
return a < b ? a : b;
}
template <class T>
T max3(T a, T b, T c) {
return Max2(Max2(a, b), c);
}
template <class T>
T min3(T a, T b, T c) {
return Min2(Min2(a, b), c);
}
template <class T>
T max4(T a, T b, T c, T d) {
return Max2(Max2(a, b), Max2(c, d));
}
template <class T>
T min4(T a, T b, T c, T d) {
return Min2(Min2(a, b), Max2(c, d));
}
const long long int mod = 1000000007ll;
const long long int Mod = 1000000009ll;
int main() {
int n;
scanf("%d", &n);
;
bool ans = true;
int tot = 0;
int last = -1;
int x;
for (int i = 0; i < n && ans; i++) {
cin >> x;
if (i == 0) {
if (x - 1 >= 15) {
ans = false;
tot = 15;
}
} else {
if (x - last - 1 >= 15) {
ans = false;
tot = last + 15;
}
}
last = x;
}
if (ans) {
if (90 - last - 1 >= 15) {
ans = false;
tot = last + 15;
} else {
tot = 90;
}
}
printf("%d", tot);
;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
cur = 15
for i in range(n):
if a[i] > cur:
break
cur = a[i] + 15
cur = min(cur, 90)
print(cur)
| 7 | PYTHON3 |
input()
A=list(map(int,input().split()))
lI=0
an=0
for a in A:
if a - lI > 15:
an += 15
break
else:
an += a - lI
lI = a
if a == A[-1]:
an = min(90, an+15)
print(an)
| 7 | PYTHON3 |
n = int(input())
q = list(map(int, input().split()))
z = [0] * 91
for e in q:
z[e] = 1
answer = 0
last15 = 0
for i in range(1, 91):
if last15 >= 15:
break
if z[i] == 1:
last15 = 0
else:
last15 += 1
answer += 1
print(answer)
| 7 | PYTHON3 |
if __name__ == "__main__":
#n, m = list(map(int, input().split()))
n = int(input())
t = [0] + list(map(int, input().split()))
ans = -1
for i in range(1, n + 1):
if t[i] - t[i - 1] - 1 >= 15:
ans = i - 1;
break;
if ans != -1:
print(t[ans] + 15)
else:
print(min(90, t[-1] + 15))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
cutoff = 15
for x in a:
if x > cutoff:
break
cutoff = x + 15
print(min(90, cutoff))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
if (b > 15) {
cout << 15;
return 0;
}
for (int i = 0; i < a; i++) {
cin >> c;
if (c - b > 15) {
cout << b + 15;
return 0;
} else {
b = c;
}
}
if (90 - c < 16) {
cout << 90;
} else {
cout << c + 15;
}
}
| 7 | CPP |
n = int(input())
a = [0]+list(map(int, input().strip().split()))
ans = 15
for i in range(n+1):
if a[i]+15 > ans:
if a[i]+15-ans <= 15:
ans = a[i]+15
ans = min(ans, 90)
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, num, arr[100], c = 0, flag = 0;
cin >> num;
arr[0] = 0;
for (int j = 1; j <= num; j++) cin >> arr[j];
for (i = 0; i < num; i++) {
c = arr[i + 1] - arr[i];
if (c > 15) {
flag = 1;
cout << arr[i] + 15 << endl;
break;
}
}
if (flag == 0) {
if (arr[i] <= 75)
cout << arr[i] + 15 << endl;
else
cout << "90" << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 99;
int n;
int P[N];
void load() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
P[x]++;
}
}
int solve() {
for (int i = 15; i <= 90; i++) {
bool da = false;
for (int j = i; j > i - 15; j--) {
if (P[j] == 1) da = true;
}
if (!da) return i;
}
return 90;
}
int main(void) {
load();
printf("%d\n", solve());
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int first, long long int n) {
if (n == 0)
return 1;
else if (n % 2 == 0) {
long long int second = power(first, n / 2);
return second * second;
} else
return first * power(first, n - 1);
}
int strTOint(string s) {
stringstream ss;
int first;
ss << s;
ss >> first;
return first;
}
double geo_dist(int a, int b, int c, int d) {
double dd = (double)(a - c) * (a - c) + (b - d) * (b - d);
double r = sqrt(dd) + 1e-9;
return r;
}
int fx[] = {0, 0, -1, 1, -1, 1, 1, -1};
int fy[] = {1, -1, 0, 0, 1, 1, -1, -1};
map<string, int> mp;
vector<pair<int, int> > adj[1000];
vector<int> v;
int main() {
int n, ans, first[100], temp = 0;
scanf("%d", &n);
ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &first[i]);
}
for (int i = 0; i < n; i++) {
if (first[i] - temp > 15) {
cout << temp + 15 << endl;
return 0;
} else
ans = first[i];
temp = first[i];
}
ans += 15;
if (ans > 90) ans = 90;
cout << ans << endl;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
current_time = 0
for i in range(n):
if current_time + 15 < a[i]:
print(current_time + 15)
exit()
else:
current_time = a[i]
print(min(current_time+15, 90)) | 7 | PYTHON3 |
number = int(input())
list_array = str(input())
list_array = list_array.split()
list_array = list_array[0:number]
x = 0
for i in range(len(list_array)):
if (int(list_array[i]) - x) > 15:
x += 15
break
else:
if number == i + 1:
if int(list_array[i]) + 15 <= 90:
x = int(list_array[i]) + 15
else:
x = 90
else:
x = int(list_array[i])
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100;
int n, a[MAX];
int main() {
cin >> n;
while (n--) {
int x;
cin >> x;
a[--x]++;
}
int cnt = 0;
for (int i = 0; i < 90; i++) {
if (a[i])
cnt = 0;
else
cnt++;
if (cnt == 15) {
cout << i + 1 << "\n";
return 0;
}
}
cout << 90 << "\n";
return 0;
}
| 7 | CPP |
# Bear and Game
def game(arr):
if arr[0] > 15:
return 15
i = arr.pop(0)
while arr:
if arr[0] > i + 15:
return i + 15
i = arr.pop(0)
return min(i + 15, 90)
n = int(input())
arr = list(map(int, input().split()))
print(game(arr)) | 7 | PYTHON3 |
n = int(input())
m = input().split()
m.insert(0,'0')
c = 15
for i in range(0,len(m)-1):
if int(m[i+1]) <= int(m[i]) + 15 :
c = int(m[i+1]) + 15
else :
break
if (c > 90): c = 90
print(c) | 7 | PYTHON3 |
t = int(input())
arr = [0] + list(map(int, input().split())) + [90]
maxx = 0
for i in range(t + 1):
maxx = arr[i] + 15
if arr[i] + 15 < arr[i + 1]:
break
print(min(maxx, 90)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[10000];
int main() {
int n;
cin >> n;
arr[0] = 0;
for (int i = 1; i <= n; i++) cin >> arr[i];
sort(arr, arr + n + 1);
int last = 0;
for (int i = 1; i <= 90; i++) {
int f = 0;
for (int j = 0; j <= n && arr[j] <= i; j++) {
if (abs(arr[j] - i) < 15) {
f = 1;
break;
}
}
if (f == 0) {
cout << i << endl;
exit(0);
}
}
cout << 90 << endl;
}
| 7 | CPP |
"""
"""
if __name__ == "__main__":
n = input()
arr = [ int(item) for item in list(input().split(' '))]
sum = 0
for index, item in enumerate(arr):
if sum + 15 >= item:
sum = item
else:
sum += 15
break
if index == len(arr) -1:
if sum + 15 >= item and sum + 15 < 90:
sum += 15
else:
sum = 90
print(sum)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
if a[0] > 15:
print(15)
exit()
a.append(90)
for i in range(n):
if a[i] + 15 < a[i+1]:
print(a[i] + 15)
exit()
print(90)
exit()
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
if l[0]>15:
print(15)
exit()
if n==1 and l[0]<=15:
print(15+l[0])
exit()
if n==1 and l[0]>15:
print(15)
exit()
ans=[]
for i in range(1,n):
if l[i]-l[i-1]<=15:
ans.append(l[i]+15)
elif l[i]-l[i-1]>15:
print(l[i-1]+15)
exit()
if ans[-1]>90:
print(90)
else:
print(ans[-1])
| 7 | PYTHON3 |
n = int(input())
s = [0]+[int(i) for i in input().split()]
for i in range(n):
if s[i+1]-s[i]>15:
print(s[i]+15)
break
else:
print(min(s[-1]+15, 90))
| 7 | PYTHON3 |
n = int(input())
t = input().split()
# current_time = 0
# total_time = 0
# for idx, i in enumerate(t):
# i = int(i)
# if i-current_time > 15:
# total_time += 15
# break
# else:
# total_time = i
# current_time = i
#
# if idx == n-1:
# if current_time + 15 <= 90:
# total_time += 15
# else:
# total_time = 90
current_time = 0
for i in t:
i = int(i)
if current_time + 15 < i:
break
else:
current_time = i
print(min(current_time+15, 90)) | 7 | PYTHON3 |
N = int(input())
A = [0] + list(map(int, input().split())) + [90]
for i in range(N + 1):
if A[i + 1] - A[i] > 15:
exit(print(A[i] + 15))
print(90)
| 7 | PYTHON3 |
n = int(input())
interest = list(map(int, input().split()))
minute = 15
if interest[0] > 15:
print(minute)
exit()
if n == 0:
print(minute)
exit()
else:
for i in range(0, n):
if interest[i] <= minute:
minute = interest[i] + 15
else:
break
if minute > 90:
print(90)
else:
print(minute) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
int i, time;
scanf("%d", &n);
int a[n + 1];
for (i = 1; i < (n + 1); i++) {
scanf("%d", &a[i]);
}
a[0] = 0;
for (i = 1; i < (n + 1); i++) {
if ((a[i] - a[i - 1]) > 15) {
time = a[i - 1] + 15;
break;
} else {
if (i == 1 || a[i] <= 75) {
time = a[i] + 15;
} else {
time = 90;
}
}
}
printf("%d", time);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1001], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
a[n + 1] = 90;
for (int i = 0; i <= n; i++)
if (a[i] + 15 < a[i + 1]) return printf("%d", min(a[i] + 15, 90)), 0;
puts("90");
}
| 7 | CPP |
n = int(input())
l = 0
t = list(map(int, input().split()))
c = 15
for i in t:
if i > c:
break
c = i+15
print(min(c, 90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int u, j, n, h, r, i, k, mm;
cin >> n;
h = mm = k = 0;
while (n != 0) {
j = h;
cin >> k;
if (k - j <= 15) {
h = k;
} else
mm = j + 15;
n--;
}
if (mm != 0) {
cout << mm;
return 0;
}
cout << min(90, h + 15);
return 0;
}
| 7 | CPP |
# ý tưởng:
# đọc vào mảng, add thêm 90 vào cuối mảng, xong duyệt qua các phần tử.
# kiểm nêu hiệu của a[i] với a[i-1] >= 15 thì kết qua bằng a[i-1]+15self
# Nếu a[0]>15 thì ket qua là 15
# nếu chậy het mang mà hieu a[i] với a[i-1] < 15 ket qua la 90
n = int(input())
moment = list(map(int, input().split()))
def stupid_bear (a):
ans = 0
for i in range (len(a)):
if i == 0:
if a[i] > 15:
ans = 15
break;
elif a[i]- a[i-1] > 15:
ans = a[i-1]+15
break;
else:
ans = a[i]
return ans
moment.append(90)
print (stupid_bear(moment)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans;
bool vis[101];
int main() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
;
cin >> n;
while (n--) {
cin >> m;
vis[m] = 1;
}
m = 15;
for (int i = 1; i <= 90; i++) {
ans++;
if (vis[i])
m = 15;
else
m--;
if (!m) break;
}
cout << min(ans, 90) << "\n";
}
| 7 | CPP |
# python3
def max_watching_time(arr):
max_time, t = 0, 0
arr = arr + [90]
for m in arr:
if m - t > 15:
return max_time + 15
max_time += m - t
t = m
return max_time
if __name__ == '__main__':
n = int(input())
arr = list(map(int, input().split()))
print(max_watching_time(arr))
| 7 | PYTHON3 |
a = int(input());
c = input().split();
dem = int(c[0]);
if dem > 15:
dem = 15;
else:
for i in range(a):
d = int(c[i]) - dem;
if d > 15:
dem = int(c[i-1]) + 15;
break
else:
if (i + 1) != a:
dem = int(c[i]);
else:
if int(c[a-1]) > 75:
dem = 90;
else:
dem = int(c[a-1])+15
print(dem) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int scan() {
int res = 0, ch;
while (!((ch = getchar()) >= '0' && ch <= '9')) {
if (ch == EOF) return 1 << 30;
}
res = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9') res = res * 10 + (ch - '0');
return res;
}
int a[100];
int main() {
int x, y, z, i, t;
scanf("%d", &x);
for (i = 1; i <= x; i++) scanf("%d", &a[i]);
int ans = 999999999;
if (a[1] > 15) {
printf("%d\n", 15);
return 0;
}
a[x + 1] = 90;
for (i = 2; i <= x + 1; i++) {
if (a[i] - a[i - 1] > 15) {
ans = a[i - 1];
break;
}
}
printf("%d\n", min(90, ans + 15));
return 0;
}
| 7 | CPP |
n=int(input())
t=list(map(int,input().split()))
r=0
if t[0]>15:
print(15)
else:
if len(t)==1:
print(t[0]+15)
else:
s=0
for i in range(n-1):
if t[i+1]-t[i]>15:
print(t[i]+15)
break
else:
s+=1
if s==len(t)-1:
if 90-t[-1]>15:
print(t[-1]+15)
else:
print(90)
| 7 | PYTHON3 |
x=eval(input())
y=list(map(int,input().split()))
k=15
i=0
if(y[i]>15):
print(15)
else:
sum=y[i]
while(i<x-1):
if(y[i+1]-y[i]<=15):
sum=sum+(y[i+1]-y[i])
else:
sum=sum+15
break
i+=1
if(i==(x-1)):
if((90-sum)<=15):
print((90-sum)+sum)
else:
print(sum+15)
else:
print(sum)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, TotalTime = 0, BoringTime = 15;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > BoringTime) {
TotalTime = BoringTime;
break;
} else if (x == BoringTime) {
TotalTime = x + 15;
BoringTime = x + 15;
} else {
BoringTime = x + 15;
TotalTime = x;
if (i == n) TotalTime += 15;
}
}
if (TotalTime < 15) TotalTime = 15;
if (TotalTime > 90) TotalTime = 90;
cout << TotalTime << endl;
return 0;
}
| 7 | CPP |
n = int(input())
l = list(map(int, input().split()))
l.insert(0,0)
for i in range(1, n + 1):
if l[i] - l[i - 1] > 15:
print(l[i - 1] + 15)
exit()
else:
print(min(90, l.pop() + 15)) | 7 | PYTHON3 |
input()
t=0
for i in map(int, input().split()):
if i - t > 15: break
else: t = i
print(min(90, t + 15)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int pre = 0, now;
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &now);
if (now - pre > 15) {
printf("%d\n", min(pre + 15, 90));
return 0;
} else {
pre = now;
}
}
printf("%d\n", min(pre + 15, 90));
return 0;
}
| 7 | CPP |
n = int(input())
s = [0] + list(map(int, input().split()))
isBreak = False
for i in range(len(s) - 1):
if s[i+1] - s[i] > 15:
print(s[i] + 15)
isBreak = True
break
if not isBreak:
print(min(90, s[-1] + 15)) | 7 | PYTHON3 |
def bear_and_game():
n = int(input())
m = list(map(int, input().split()))
t = 0
for x in m:
if(t+15 < x):
return t + 15
else:
t = x
if(t + 15 > 90):
return 90
else:
return t + 15
print(bear_and_game()) | 7 | PYTHON3 |
n = int(input())
ns = list(map(int, input().split()))
t = 0
for i in range(n):
if t + 15 < ns[i]:
print(t + 15)
exit()
else:
t = ns[i]
print(min(90, t + 15)) | 7 | PYTHON3 |
a=int(input())
b=input()
#"16 20 30 40 50 60 70 80 90"
#"6 11 12 15 22 24 30 31 32 33 34 35 40 42 44 45 47 50 53 54 57 58 63 67 75 77 79 81 83 88"
z=[int(n) for n in b.split()]
z.append(0)
z.append(90)
z.sort()
l=0
#print(z)
for n in range(a+1):
if z[n+1]-z[n]<=15:
# l=z[n+1]
# print(z[n+1]-z[n])
continue
else:
l=z[n]+15
# print("ggg",z[n])
break
if l==0:
l=90
print(l) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = 0
i = 0
while b + 15 >= a[i]:
#print(str(b) + " " + str(a[i]), end='\n')
b = a[i]
i = i + 1
if i >= n or b >= 90:
break
b = b + 15
if b > 90: b = 90
print(b)
| 7 | PYTHON3 |
x=int(input())
l=list(map(int,input().split()))
s=0
f=0
for i in range(len(l)-1):
if l[0]>15:
f=1
print(15)
break
elif l[0]<=15:
if l[i]+15<l[i+1]:
s=l[i]+15
break
else:
s=l[i+1]
#print(s)
if len(l)==1 and f!=1 and l[0]<=15:
print(l[0]+15)
elif len(l)==1 and f!=1 and l[0]>15:
print(15)
else:
if not f and s==l[-1]:
if s+15<=90:
print(s+15)
elif s+15>90:
print(90)
elif not f:
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
int n, answer, root, curr;
int parent[NMAX];
int vis[NMAX];
vector<int> roots;
void dfs(int node) {
if (vis[node] != 0) {
if (vis[node] == curr) {
parent[node] = node;
roots.push_back(node);
} else {
return;
}
}
vis[node] = curr;
if (node != parent[node]) {
dfs(parent[node]);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> parent[i];
if (parent[i] == i) {
root = i;
roots.push_back(i);
}
}
if (roots.empty()) answer = 1;
for (int i = 1; i <= n; ++i) {
++curr;
dfs(i);
}
for (int &x : roots) {
parent[x] = roots[0];
++answer;
}
--answer;
cout << answer << '\n';
for (int i = 1; i <= n; ++i) {
cout << parent[i] << ' ';
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
struct debugger {
static void call(const char* it) {}
template <typename T, typename... valT>
static void call(const char* it, T val, valT... rest) {
string var = "";
for (; *it && *it != ','; it++)
if (*it != ' ') var += *it;
cerr << var << '=' << val << " ";
call(++it, rest...);
}
};
const int MAX = 2e5 + 10;
int P[MAX], V[MAX], root = -1, cnt = 0;
void dfs(int u) {
V[u] = 1;
int v = P[u];
if (!V[v]) {
dfs(v);
} else if (V[v] == 1) {
if (root != u) {
if (root == -1) root = u;
P[u] = root, cnt++;
}
}
V[u] = 2;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (int)n; i++) {
scanf("%d", &P[i + 1]);
if (P[i + 1] == i + 1) root = i + 1;
}
for (int i = 0; i < (int)n; i++) {
int u = i + 1;
if (!V[u]) {
dfs(u);
}
}
printf("%d\n", cnt);
for (int i = 0; i < (int)n; i++) {
printf("%d ", P[i + 1]);
}
puts("");
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 200200;
int a[N], cmp, ans;
vector<int> adj[N];
queue<int> q;
int visited[N];
void dfs(int u, int par = -1) {
visited[u] = cmp;
for (int v : adj[u]) {
if (!visited[v]) {
dfs(v, u);
} else if (visited[v] == cmp) {
q.push(v);
}
}
}
int main() {
int n, x, root = -1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
a[i] = x;
adj[i].push_back(x);
if (x == i) {
root = i;
}
}
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
++cmp;
dfs(i);
}
}
if (root == -1) {
root = q.front();
q.pop();
a[root] = root;
++ans;
}
while (!q.empty()) {
a[q.front()] = root;
if (q.front() != root) ans++;
q.pop();
}
printf("%d\n", ans);
for (int i = 1; i <= n; i++) {
printf("%d ", a[i]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int P[200005], N;
vector<int> E[200005];
int Color[200005];
int BRKA, Root[200005], Size[200005], Sink[200005];
void dfs(int x) {
if (Color[x]) return;
Color[x] = BRKA;
Size[BRKA]++;
for (int y : E[x]) dfs(y);
}
int nadji(int x, int step) {
while (step--) {
x = P[x];
}
return x;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", P + i);
E[i].push_back(P[i]);
E[P[i]].push_back(i);
}
for (int i = 1; i <= N; i++) {
if (!Color[i]) {
BRKA++;
Root[BRKA] = i;
dfs(i);
}
}
for (int i = 1; i <= BRKA; i++) {
Sink[i] = nadji(Root[i], Size[i]);
}
int ima = -1;
for (int i = 1; i <= BRKA; i++) {
if (Sink[i] == P[Sink[i]]) ima = i;
}
if (ima != -1) {
swap(Root[ima], Root[1]);
swap(Size[ima], Size[1]);
swap(Sink[ima], Sink[1]);
}
int chg = 0;
for (int i = BRKA; i > 1; i--) {
P[Sink[i]] = Root[i - 1];
chg++;
}
if (ima == -1) {
P[Sink[1]] = Sink[1];
chg++;
}
printf("%d\n", chg);
for (int i = 1; i <= N; i++) printf("%d%c", P[i], i == N ? '\n' : ' ');
scanf("%d", &N);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
int n, a[200005], c[200005], cnt;
vector<int> g[200005];
vector<int> fc[200005];
vector<int> v;
void dfs(int i) {
if (c[i] != 0) return;
c[i] = cnt;
fc[cnt].push_back(i);
for (int j = 0; j < (g[i].size()); j++) dfs(g[i][j]);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
g[i].push_back(a[i]);
g[a[i]].push_back(i);
}
for (int i = 1; i <= n; i++) {
if (c[i] != 0) continue;
cnt++;
dfs(i);
int p = fc[cnt][0];
for (int j = 0; j < (fc[cnt].size()); j++) p = a[p];
v.push_back(p);
}
int s = -1;
for (int i = 1; i <= n; i++) {
if (a[i] == i) {
cnt--;
s = i;
break;
}
}
if (s == -1) {
s = v[0];
a[s] = s;
}
for (int i = 0; i < (v.size()); i++)
if (v[i] != s) a[v[i]] = s;
cout << cnt << endl;
for (int i = 1; i <= n; i++) {
cout << a[i];
cout << ((i == n) ? '\n' : ' ');
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
int n, p[200005], newp[200005];
bool s[200005];
bool cmp(int a, int b) { return abs(a - p[a]) < abs(b - p[b]); }
int main() {
cin >> n;
for (int i = 0; i < (n); i++) {
cin >> p[i];
p[i]--;
}
vector<int> v;
for (int i = 0; i < (n); i++)
if (!s[i]) {
set<int> st;
int j;
for (j = i; !s[j]; j = p[j]) {
st.insert(j);
s[j] = 1;
}
if (st.count(j)) v.push_back(j);
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < (n); i++) newp[i] = p[i];
for (int i = 0; i < (v.size()); i++) newp[v[i]] = v[0];
int ans = 0;
for (int i = 0; i < (n); i++) ans += (p[i] != newp[i]);
cout << ans << endl;
for (int i = 0; i < (n); i++)
cout << 1 + newp[i] << (i == n - 1 ? '\n' : ' ');
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a, ans[200005], A[200005], root = -1, f;
bool b[200005];
vector<int> v[200005];
vector<int> cyc;
void dfs(int u, int p) {
for (auto x : v[u]) {
if (b[x] && x != p) {
if (A[x] == u)
cyc.push_back(x);
else
cyc.push_back(u);
} else if (!b[x]) {
b[x] = 1;
dfs(x, u);
}
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
if (A[i] == i) {
root = i;
f = 1;
}
v[i].push_back(A[i]);
v[A[i]].push_back(i);
ans[i] = A[i];
}
for (int i = 1; i <= n; i++) {
if (!b[i]) b[i] = 1, dfs(i, -1);
}
if (root == -1) {
root = cyc[0];
}
for (int i = 0; i < (int)cyc.size(); i++) ans[cyc[i]] = root;
int q = 0;
for (int i = 1; i <= n; i++)
if (A[i] != ans[i]) q++;
printf("%d\n", q);
for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T next_int() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') {
p = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * p;
}
const int max_n = (int)1e6 + 227 + 1;
const int max_int = (int)1e9 + 227 + 1;
const int mod = (int)1e9 + 7;
vector<vector<int> > a;
vector<bool> used;
vector<int> lol;
void go(int v, int pr) {
if (used[v]) return;
used[v] = 1;
for (int i = 0; i < a[v].size(); i++) {
if (a[v][i] == pr) continue;
if (used[a[v][i]]) {
lol.back() = v;
}
go(a[v][i], v);
}
}
int main() {
int n = next_int<int>();
int k = 0;
vector<int> p(n);
a.resize(n);
for (int i = 0; i < n; i++) {
p[i] = next_int<int>() - 1;
k += (p[i] == i);
a[p[i]].push_back(i);
a[i].push_back(p[i]);
}
used.resize(n);
for (int i = 0; i < n; i++) used[i] = 0;
for (int i = 0; i < n; i++) {
if (!used[i]) lol.push_back(-1);
go(i, -1);
}
int pe = -1;
for (int i = 0; i < lol.size(); i++) {
if (p[lol[i]] == lol[i]) pe = i;
}
cout << (int)lol.size() - (pe != -1) << "\n";
if (pe == -1) {
p[lol[0]] = lol[0];
pe = 0;
}
for (int i = 0; i < lol.size(); i++) {
if (i == pe) continue;
p[lol[i]] = lol[pe];
}
for (int i = 0; i < n; i++) cout << p[i] + 1 << " ";
puts("");
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
const long long N = 2e5 + 7;
const long long MOD = 1e9 + 7;
long long pw(long long b, long long p) {
b %= MOD;
long long res = 1;
while (p > 0) {
if (p & 1) res = res * b % MOD;
b = b * b % MOD;
p >>= 1;
}
return res;
}
vector<long long> par(N);
long long find(long long x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
for (long long i = 1; i < n + 1; i++) {
par[i] = i;
}
vector<long long> a(n + 1);
long long cnt = 0, root = 0;
for (long long i = 1; i < n + 1; i++) {
cin >> a[i];
if (a[i] == i) {
root = i;
cnt++;
} else {
long long x = find(i), y = find(a[i]);
if (x == y) {
a[i] = i;
cnt++;
} else {
par[i] = a[i];
}
}
}
if (root == 0) {
for (long long i = 1; i < n + 1; i++) {
if (a[i] == i) root = i;
}
cnt++;
}
cout << cnt - 1 << '\n';
for (long long i = 1; i < n + 1; i++) {
cout << ((a[i] == i) ? root : a[i]) << ' ';
}
return 0;
}
| 8 | CPP |
from collections import defaultdict
from sys import stdin,setrecursionlimit
setrecursionlimit(10**6)
import threading
def f(a):
n=len(a)
a=list(map(lambda s:s-1,a))
root=None
for i in range(len(a)):
if a[i]==i:
root=i
vis=[0]*(n)
traitors=[]
for i in range(0,n):
cycle=-1
cur=i
move=set()
while vis[cur]==0:
vis[cur]=1
move.add(cur)
if a[cur] in move:
cycle=cur
cur=a[cur]
if cycle!=-1:
traitors.append(cycle)
ans=len(traitors)-1
if root==None:
a[traitors[0]]=traitors[0]
root=traitors[0]
ans+=1
for i in traitors:
if i!=root:
a[i]=root
print(ans)
a=list(map(lambda s:s+1,a))
return a
n=input()
a=list(map(int,input().strip().split()))
print(*f(a)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using LL = long long;
const int N = 200000 + 5;
int A[N], n;
int vis[N], tim;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", A + i);
}
std::vector<int> bad;
for (int i = 1; i <= n; ++i) {
if (vis[i] == 0) {
tim++;
for (int u = i;; u = A[u]) {
vis[u] = tim;
if (vis[A[u]] == tim) {
bad.emplace_back(u);
break;
} else if (vis[A[u]]) {
break;
}
}
}
}
for (int i = 0; i < (int)bad.size(); ++i) {
if (A[bad[i]] == bad[i]) {
std::rotate(bad.begin(), bad.begin() + i, bad.end());
break;
}
}
int cost = (int)bad.size() - (A[bad[0]] == bad[0]);
for (int x : bad) A[x] = bad[0];
printf("%d\n", cost);
for (int i = 1; i <= n; ++i) {
printf("%d%c", A[i], " \n"[i == n]);
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const int inf = 1e9;
int p[maxn], f[maxn], n;
int root(int x) {
if (!f[x]) return x;
return f[x] = root(f[x]);
}
int merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return 0;
f[x] = y;
return 1;
}
int main() {
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &p[i]);
if (merge(i, p[i]))
cnt++;
else if (i != p[i])
p[i] = -1;
}
int x = 0;
for (int i = 1; i <= n; i++) {
if (!f[i] && p[i] != -1) {
x = i;
break;
}
}
if (x == 0) {
x = root(1);
cnt--;
}
printf("%d\n", n - 1 - cnt);
for (int i = 1; i <= n; i++) {
if (!f[i]) {
p[i] = x;
}
printf("%d ", p[i]);
}
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200100;
int n, a[MAX], czas[MAX];
vector<int> cykl;
void wczytaj_dane() {
cin >> n;
for (int i = (1); i <= (n); i++) cin >> a[i];
}
int znajdz_cykl(int v, int t) {
while (czas[v] == 0) {
czas[v] = t;
v = a[v];
}
return czas[v] == t ? v : -1;
}
void wypelnij_cykl() {
fill(czas, czas + MAX, 0);
int t = 1;
for (int v = (1); v <= (n); v++) {
int u = znajdz_cykl(v, t++);
if (u != -1) cykl.push_back(u);
}
}
int znajdz_staly_cykl() {
for (int i = 0; i < ((int((cykl).size()))); i++)
if (a[cykl[i]] == cykl[i]) return cykl[i];
return -1;
}
int rozwiaz() {
int staly = znajdz_staly_cykl(), licz = 0;
if (staly == -1) {
a[cykl[0]] = cykl[0];
staly = cykl[0];
licz++;
}
for (int i = 0; i < ((int((cykl).size()))); i++)
if (a[cykl[i]] != staly) {
a[cykl[i]] = staly;
licz++;
}
return licz;
}
void wypisz_rozwiazanie() {
for (int i = (1); i <= (n); i++) cout << a[i] << ' ';
cout << '\n';
}
void zrob_test() {
wczytaj_dane();
wypelnij_cykl();
cout << rozwiaz() << '\n';
wypisz_rozwiazanie();
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
zrob_test();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int color[200001];
int root;
int save[200001];
vector<int> data[200001];
int changes;
void dfs(int source) {
color[source] = 1;
int len = data[source].size();
for (int i = 0; i < len; i++) {
if (source == data[source][i]) {
if (root == 0)
root = source;
else if (root != source) {
save[source] = root;
changes++;
}
} else if (color[data[source][i]] == 0) {
dfs(data[source][i]);
} else if (color[data[source][i]] == 1) {
if (root == 0) root = source;
save[source] = root;
changes++;
}
}
color[source] = 2;
}
int main(void) {
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> save[i];
data[i].push_back(save[i]);
if (root == 0 && i == save[i]) root = i;
}
for (int i = 1; i <= n; i++) {
if (color[i] == 0) dfs(i);
}
cout << changes << "\n";
for (int i = 1; i <= n; i++) cout << save[i] << ' ';
cout << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
inline long long getnum() {
register long long r = 0;
register bool ng = 0;
register char c;
c = getchar();
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-') ng = 1, c = getchar();
while (c != ' ' && c != '\n') r = r * 10 + c - '0', c = getchar();
if (ng) r = -r;
return r;
}
template <class T>
inline void putnum(T x) {
if (x < 0) putchar('-'), x = -x;
register short a[20] = {}, sz = 0;
while (x > 0) a[sz++] = x % 10, x /= 10;
if (sz == 0) putchar('0');
for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline void putsp() { putchar(' '); }
inline void putendl() { putchar('\n'); }
inline char mygetchar() {
register char c = getchar();
while (c == ' ' || c == '\n') c = getchar();
return c;
}
int n;
int head[200111], nxt[400111], to[400111], tot = 1;
bool vis[200111];
int p[200111];
int X, Y;
void dfs(int x, int pre) {
vis[x] = 1;
for (int i = head[x]; i; i = nxt[i]) {
if (!vis[to[i]]) {
dfs(to[i], i / 2);
} else if (i / 2 != pre) {
X = x;
Y = to[i];
}
}
}
int main() {
n = getnum();
int ans = 0, fb = 0;
for (int i = 1; i <= n; i++) {
p[i] = getnum();
nxt[++tot] = head[i];
head[i] = tot;
to[tot] = p[i];
nxt[++tot] = head[p[i]];
head[p[i]] = tot;
to[tot] = i;
if (i == p[i]) fb = i;
}
if (fb) dfs(fb, -1);
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
X = Y = -1;
dfs(i, -1);
if (p[Y] == X) swap(X, Y);
if (!fb) {
ans++;
p[X] = X, fb = X;
} else {
ans++;
p[X] = fb;
}
}
}
putnum(ans), putendl();
for (int i = 1; i <= n; i++) putnum(p[i]), putsp();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
const unsigned long long int mod = 1e9 + 7;
long long int power(long long int x, long long int y) {
long long int res = 1;
while (y > 0) {
if (y & 1) res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
vector<long long int> arr, ans1, ans;
long long int res = 0, total;
long long int get(long long int x) {
if (x == arr[x]) return arr[x];
return get(arr[x]);
}
void merge(long long int a, long long int b, long long int kk[]) {
long long int t1 = a, t2 = b;
if (a == b) return;
a = get(a);
b = get(b);
if (a == b) {
return;
}
arr[b] = a;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t;
t = 1;
while (t--) {
long long int n, k = -1;
cin >> n;
long long int kk[n], aa[n];
arr.resize(n);
for (long long int i = 0; i < n; i++) arr[i] = i;
bool flag = true;
for (long long int i = 0; i < n; i++) {
cin >> kk[i];
aa[i] = kk[i];
if (kk[i] == i + 1) {
if (flag)
k = i;
else
ans.push_back(i);
flag = false;
} else if (get(i) == get(kk[i] - 1)) {
ans.push_back(i);
} else
merge(kk[i] - 1, i, kk);
}
long long int i = 0;
if (k == -1) k = ans[0], i = 1, kk[ans[0]] = ans[0] + 1;
for (i; i < ans.size(); i++) {
kk[ans[i]] = k + 1;
}
for (long long int i = 0; i < n; i++) {
if (kk[i] != aa[i]) res++;
}
cout << res << '\n';
for (auto x : kk) cout << x << " ";
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int Read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') {
f = -1;
}
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return s * f;
}
inline void Wte(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (x > 9) {
Wte(x / 10);
}
putchar(x % 10 + '0');
}
inline void Write(int x) {
Wte(x);
putchar(' ');
}
const int MAXN = 200010;
int N;
int a[MAXN];
bool vis[MAXN];
vector<vector<int> > cycle, tree;
int p[MAXN];
void iint() {
for (int i = 0; i < N; i++) {
p[i] = i;
}
}
int dsu(int x) { return x == p[x] ? x : p[x] = dsu(p[x]); }
void Merge(int x, int y) { p[dsu(x)] = dsu(y); }
void solve() {
int cost = 0;
N = Read();
iint();
for (int i = 0; i < N; i++) {
a[i] = Read();
a[i]--;
Merge(i, a[i]);
}
for (int i = 0; i < N; i++) {
p[i] = dsu(p[i]);
}
vector<int> v;
for (int i = 0; i < N; i++) {
if (p[i] == i) {
v.push_back(i);
cost++;
}
}
int root = -1;
for (int i = 0; i < N; i++) {
if (a[i] == i) {
cost--;
root = i;
break;
}
}
if (root == -1) {
root = v[0];
a[root] = root;
}
for (int i = 0; i < v.size(); i++) {
if (v[i] != root) {
a[v[i]] = root;
}
}
Write(cost);
puts("");
for (int i = 0; i < N; i++) {
Write(a[i] + 1);
}
puts("");
}
void Times(int T) {
while (T--) {
solve();
}
}
int main() {
int T;
T = 1;
Times(T);
return 0;
}
| 8 | CPP |
Subsets and Splits