LittleSheep/Algorithm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

✅

Browse Source 
P5686 100pts
This commit is contained in:
LittleSheep
2024-10-22 22:03:21 +08:00
parent b2505a5361
commit 241c4863c9
4 changed files with 40 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
insert-sort/main.cc
View File

@@ -5,7 +5,7 @@ using namespace std;
const int N = 10005;
pair<int, int> arr[N];
int b[N];
int beta[N];
int main() {
int n, m;
@@ -15,23 +15,23 @@ int main() {
arr[i].second = i;
}
sort(arr + 1, arr + n + 1);
for (int i = 1; i <= n; i++) b[arr[i].second] = i;
for (int i = 1; i <= n; i++) beta[arr[i].second] = i;
while (m--) {
int op, x, y;
scanf("%d", &op);
if (op == 1) {
scanf("%d%d", &x, &y);
arr[b[x]].first = y;
arr[beta[x]].first = y;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[i + 1]) swap(arr[i], arr[i + 1]);
}
for (int i = n - 1; i >= 1; i--) {
if (arr[i] > arr[i + 1]) swap(arr[i], arr[i + 1]);
}
for (int i = 1; i <= n; i++) b[arr[i].second] = i;
for (int i = 1; i <= n; i++) beta[arr[i].second] = i;
} else {
scanf("%d", &x);
printf("%d\n", b[x]);
printf("%d\n", beta[x]);
}
}
return 0;