Submission #210273

#TimeUsernameProblemLanguageResultExecution timeMemory
210273daniel920712Bubble Sort 2 (JOI18_bubblesort2)C++14
0 / 100
9092 ms524288 KiB
#include "bubblesort2.h" #include <vector> using namespace std; vector < int > answer; int con[105]; vector<int> countScans(vector < int > A,vector < int > X,vector < int > V ) { int N=A.size(),Q=X.size(),ans=0,i,j,k; for(i=0;i<Q;i++) { for(j=0;j<N;j++) { ans=0; A[X[i]]=V[i]; for(k=A[j]+1;k<=100;k++) ans+=con[k]; answer.push_back(ans); for(k=0;k<=A[j];k++) con[k]++; } } return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...