Submission #363182

#TimeUsernameProblemLanguageResultExecution timeMemory
363182buyolitsezBubble Sort 2 (JOI18_bubblesort2)C++17
0 / 100
9022 ms620 KiB
#include <bits/stdc++.h> using namespace std; vector <int> countScans(vector<int> a, vector<int> x, vector<int> v) { int n = a.size(), q = x.size(); vector <int> s(q); for(int f = 0; f < q; ++f) { a[x[f]] = v[f]; int cnt = 0; vector<int> b = a; for(int i = 0; i < n; ++i) { for (int j = 0; j + 1 < n; ++j) { if (a[j] > a[j + 1]) { swap(a[j], a[j + 1]); ++cnt; } } } swap(a, b); s[f] = cnt; } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...