Submission #1089997

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1089997	2024-09-17 14:02:22	VMaksimoski008	Bubble Sort 2 (JOI18_bubblesort2)	C++17	38 / 100	650 ms	868 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
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
 
const int maxn = 5e5 + 5;
 
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) {
  int n = A.size(), q = X.size();
 
  vector<int> ans(q);
  
    //goody ahh ideja, sto bi kazal bratot Nikola
    vector<int> p(n);
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++) p[i] += (A[j] < A[i]);
    
    for(int it=0; it<q; it++) {
        for(int i=0; i<n; i++) p[i] -= (A[X[it]] < A[i]);
        A[X[it]] = V[it];
        p[X[it]] = 0;
        for(int i=0; i<n; i++) p[X[it]] += (A[i] < A[X[it]]);
        for(int i=0; i<n; i++) p[i] += (A[X[it]] < A[i]);
        for(int i=0; i<n; i++) ans[it] = max(ans[it], i - p[i]);
    }
 
  return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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