-
Notifications
You must be signed in to change notification settings - Fork 0
/
Frog Sort - FROGS.cpp
115 lines (113 loc) · 3.7 KB
/
Frog Sort - FROGS.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// https://www.codechef.com/FEB21B/problems/FROGS
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int t, n, temp;
cin >> t;
while (t--) {
cin >> n;
vector <int> weight, jump, sw, ind, new_ind;
for (int i = 0; i < n; i++) {
cin >> temp;
weight.push_back(temp);
ind.push_back(i);
}
for (int i = 0; i < n; i++) {
cin >> temp;
jump.push_back(temp);
}
sw = weight;
sort(sw.begin(), sw.end());
if (n == 2) {
int ans = 0, ind;
auto it = find(weight.begin(), weight.end(), sw[0]);
ind = it - weight.begin();
new_ind.push_back(ind);
it = find(weight.begin(), weight.end(), sw[1]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind < new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
while (new_ind[1] <= new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
}
}
cout << ans << "\n";
}
else if (n == 3) {
int ans = 0, ind;
auto it = find(weight.begin(), weight.end(), sw[0]);
ind = it - weight.begin();
new_ind.push_back(ind);
it = find(weight.begin(), weight.end(), sw[1]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind <= new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
while (new_ind[1] <= new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
}
}
it = find(weight.begin(), weight.end(), sw[2]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind <= new_ind[1]) {
ans += 1;
new_ind[2] += jump[ind];
while (new_ind[2] <= new_ind[1]) {
ans += 1;
new_ind[2] += jump[ind];
}
}
cout << ans << "\n";
}
else {
int ans = 0, ind;
auto it = find(weight.begin(), weight.end(), sw[0]);
ind = it - weight.begin();
new_ind.push_back(ind);
it = find(weight.begin(), weight.end(), sw[1]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind <= new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
while (new_ind[1] <= new_ind[0]) {
ans += 1;
new_ind[1] += jump[ind];
}
}
it = find(weight.begin(), weight.end(), sw[2]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind <= new_ind[1]) {
ans += 1;
new_ind[2] += jump[ind];
while (new_ind[2] <= new_ind[1]) {
ans += 1;
new_ind[2] += jump[ind];
}
}
it = find(weight.begin(), weight.end(), sw[3]);
ind = it - weight.begin();
new_ind.push_back(ind);
if (ind <= new_ind[2]) {
ans += 1;
new_ind[3] += jump[ind];
while (new_ind[3] <= new_ind[2]) {
ans += 1;
new_ind[3] += jump[ind];
}
}
cout << ans << "\n";
}
}
return 0;
}