Submission #210280

#TimeUsernameProblemLanguageResultExecution timeMemory
210280daniel920712Bubble Sort 2 (JOI18_bubblesort2)C++14
0 / 100
4309 ms736 KiB
#include "bubblesort2.h"
#include <vector>

using namespace std;
vector < int > answer;
bool con[105]={0};
vector<int> countScans(vector < int > A,vector < int > X,vector < int > V )
{
	int N=A.size(),Q=X.size(),ans=0,i,j,k,ok=0;
	for(i=0;i<Q;i++)
    {
        ans=0;
        ok=0;
        for(j=0;j<=100;j++) con[j]=0;
        A[X[i]]=V[i];
        for(j=N-1;j>=0;j--)
        {
            for(k=0;k<A[j];k++) if(con[k]) ok=1;
            for(k=A[j];k<=100;k++) con[k]=1;
            ans+=ok;

        }
        answer.push_back(ans);

    }
	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...