Submission #364432

# Submission time Handle Problem Language Result Execution time Memory
364432 2021-02-09T06:48:25 Z Jarif_Rahman Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
9000 ms 620 KB
#include "bubblesort2.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<int> countScans(vector<int> a, vector<int> in, vector<int> v){
	int n = a.size(), q = v.size();
	vector<int> ans(q);
	for(int i = 0; i < q; i++){
		a[in[i]] = v[i];
		ans[i] = 0;
		for(int j = 0; j < n; j++) for(int k = 0; k < j; k++) if(a[k] > a[j]) ans[i]++;
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 400 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 400 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 9094 ms 620 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 400 KB Output isn't correct
2 Halted 0 ms 0 KB -