Submission #363313

#	Time	Username	Problem	Language	Result	Execution time	Memory
363313		buyolitsez	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	9058 ms	524292 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>

using namespace std;

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

std::vector<int> countScans(std::vector<int> a,std::vector<int> x,std::vector<int> v){
    int n = a.size(), q = x.size();
    vector <int> s(q, n - 1);
    vector<int> b = a;
    for(int f = 0; f < q; ++f) {
        a[x[f]] = v[f];
        b[x[f]] = v[f];
        int cnt = 0;
        vector <pair <int, int>> segs;
        for (int i = 0; i < n; ++i) {
            int last = i;
            for (int j = i + 1; j < n; ++j) {
                if (a[i] > a[j]) {
                    segs.emplace_back(last, j);
                    last = j;
                }
            }
        }
        int g = segs.size();
        vector <bool> used(g, 0);
        int ost = g;
        while (ost) {
            ++cnt;
            int last = -1;
            for (int i = 0; i < g; ++i) {
                if (used[i] || segs[i].first < last) {continue;}
                last = segs[i].second;
                --ost;
                used[i] = 1;
            }
        }
        s[f] = cnt;
        a = b;
    }
    return s;
}

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