oj.uz

Submission #210275

# Submission time Handle Problem Language Result Execution time Memory
210275 2020-03-17T01:31:15 Z daniel920712 Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 4658 ms 632 KB 
#include "bubblesort2.h"
#include <vector>

using namespace std;
vector < int > answer;
int 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;
	for(i=0;i<Q;i++)
    {
        ans=0;
        for(j=0;j<=100;j++) con[j]=0;
        for(j=0;j<N;j++)
        {

            A[X[i]]=V[i];
            for(k=A[j]+1;k<=100;k++) ans+=con[k];
            for(k=0;k<=A[j];k++) con[k]++;
        }
        answer.push_back(ans);

    }
	return answer;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 4658 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -