Submission #233535

#	Time	Username	Problem	Language	Result	Execution time	Memory
233535		ChrisT	Bubble Sort 2 (JOI18_bubblesort2)	C++17	38 / 100	9043 ms	2176 KiB

bubblesort2

    #include<bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using pii = pair<int,int>;
    using pll = pair<ll,ll>;
    using pli = pair<ll,int>;
    using pil = pair<int,ll>;
    using ld = long double;
    #define all(x) (x).begin(),(x).end()
    const int MN = 1e5 + 5, MOD = 1e9 + 7, BASE = 131;
    vector<int> ret; vector<pii> na;
    vector<int> countScans (vector<int> A, vector<int> X, vector<int> V) {
    	int n = A.size();
    	ret.resize(n);
    	int q = X.size();
    	na.resize(n); ret.resize(q);
    	for (int j = 0; j < q; j++) {
    		A[X[j]] = V[j];
    		for (int i = 0; i < n; i++) na[i] = {A[i],i};
    		stable_sort(all(na),[](const pii &a, const pii &b){return a.first < b.first;});
    		int ans = 0;
    		for (int i = 0; i < n; i++) ans = max(ans,na[i].second-i);
    		ret[j] = ans;
    	}
    	return ret;
    }

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