Submission #58393

#TimeUsernameProblemLanguageResultExecution timeMemory
583933zpBubble Sort 2 (JOI18_bubblesort2)C++14
0 / 100
9015 ms1632 KiB
#include "bubblesort2.h" #include<bits/stdc++.h> using namespace std; int A[109],a[50009], s[109]; std::vector<int> countScans(std::vector<int> A1,std::vector<int> X,std::vector<int> V){ vector<int> answer; int n,q; // cin >> n >> q; n = A1.size(); q = X.size(); for(int i = 1; i <= n; i++) a[i] = A1[i-1], A[a[i]]++; for(int i = 0 ; i < q; i++){ int p, v; p = X[i] +1; v = V[i]; A[a[p]] --; A[v] ++; a[p] = v; int M= 0; for(int i = 0; i <= 100; i++) s[i] = 0; for(int i = 1; i <= n; i++){ int p = 1; for(int j = 0; j < a[i]; j++){ p += A[j]; } p += s[a[i]]; s[a[i]] ++; M = max(M, i - p); } answer.push_back(M); } return answer; // cout << M << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...