Submission #1089574

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1089574	2024-09-16 17:12:50	VMaksimoski008	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	9035 ms	2604 KiB

bubblesort2

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
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int maxn = 5e5 + 5;
int tree[maxn], n;
void update(int p, int v) {
  for(p++; p<n; p+=p&-p) tree[p] += v;
}
int query(int p) {
  int ans = 0;
  for(p++; p; p-=p&-p) ans += tree[p];
  return ans;
}
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) {
  n = A.size(); int q = X.size();
  vector<int> ans(q);
  for(int it=0; it<q; it++) {
    A[X[it]] = V[it];
    for(int i=0; i<n+5; i++) tree[i] = 0;
    vector<pii> vec;
    for(int i=0; i<n; i++) vec.push_back({ A[i], i });
    sort(vec.begin(), vec.end(), [&](pii &a, pii &b) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40