제출 #1188859

#제출 시각아이디문제언어결과실행 시간메모리
1188859alexddBubble Sort 2 (JOI18_bubblesort2)C++20
0 / 100
11 ms1860 KiB
#include "bubblesort2.h" #include<bits/stdc++.h> using namespace std; int ult[105],sub[105]; map<int,set<int>> ofval; std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V) { for(int i=0;i<A.size();i++) ofval[A[i]].insert(i); vector<int> sol; for(int i=0;i<X.size();i++) { ofval[A[X[i]]].erase(X[i]); A[X[i]] = V[i]; ofval[A[X[i]]].insert(X[i]); int pref=0,mxm=0; for(int val=1;val<=100;val++) { if(ofval[val].empty()) continue; pref += ofval[val].size(); int ult = *ofval[val].rbegin(); mxm = max(mxm, ult - pref); } sol.push_back(mxm); } return sol; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...