Submission #884020

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
884020	2023-12-06T14:29:25 Z	vjudge1	Bubble Sort 2 (JOI18_bubblesort2)	C++17	17 / 100	9000 ms	2904 KB

bubblesort2

#include "bubblesort2.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int n;
int a[500005];
int aib[500005];
int calcmax()
{
    ordered_set s;
    int mxm=0;
    for(int i=0;i<n;i++)
    {
        s.insert(a[i]);
        int cv = s.order_of_key(a[i]);
        mxm = max(mxm, i-cv);
    }
    return mxm;
}
std::vector<int> countScans(std::vector<int> A, std::vector<int> qp, std::vector<int> qv){
	int q=qp.size();
	n=A.size();
	for(int i=0;i<n;i++)
        a[i]=A[i];
	std::vector<int> answer(q);
	for (int i=0;i<q;i++)
	{
        a[qp[i]] = qv[i];
        answer[i] = calcmax();
	}
	return answer;
}
/**
4 2
1 2 3 4
0 3
2 1
*/

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	47 ms	2396 KB	Output is correct
2	Correct	120 ms	2396 KB	Output is correct
3	Correct	772 ms	2640 KB	Output is correct
4	Correct	773 ms	2644 KB	Output is correct
5	Correct	760 ms	2624 KB	Output is correct
6	Correct	735 ms	2624 KB	Output is correct
7	Correct	766 ms	2804 KB	Output is correct
8	Correct	776 ms	2620 KB	Output is correct
9	Correct	797 ms	2632 KB	Output is correct
10	Correct	666 ms	2616 KB	Output is correct
11	Correct	669 ms	2624 KB	Output is correct
12	Correct	656 ms	2396 KB	Output is correct
13	Correct	688 ms	2396 KB	Output is correct
14	Correct	666 ms	2628 KB	Output is correct
15	Correct	641 ms	2620 KB	Output is correct
16	Correct	649 ms	2640 KB	Output is correct
17	Correct	649 ms	2392 KB	Output is correct
18	Correct	691 ms	2620 KB	Output is correct

Subtask #2

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	47 ms	2396 KB	Output is correct
2	Correct	120 ms	2396 KB	Output is correct
3	Correct	772 ms	2640 KB	Output is correct
4	Correct	773 ms	2644 KB	Output is correct
5	Correct	760 ms	2624 KB	Output is correct
6	Correct	735 ms	2624 KB	Output is correct
7	Correct	766 ms	2804 KB	Output is correct
8	Correct	776 ms	2620 KB	Output is correct
9	Correct	797 ms	2632 KB	Output is correct
10	Correct	666 ms	2616 KB	Output is correct
11	Correct	669 ms	2624 KB	Output is correct
12	Correct	656 ms	2396 KB	Output is correct
13	Correct	688 ms	2396 KB	Output is correct
14	Correct	666 ms	2628 KB	Output is correct
15	Correct	641 ms	2620 KB	Output is correct
16	Correct	649 ms	2640 KB	Output is correct
17	Correct	649 ms	2392 KB	Output is correct
18	Correct	691 ms	2620 KB	Output is correct
19	Execution timed out	9036 ms	2904 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 22.0

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

Subtask #4

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	47 ms	2396 KB	Output is correct
2	Correct	120 ms	2396 KB	Output is correct
3	Correct	772 ms	2640 KB	Output is correct
4	Correct	773 ms	2644 KB	Output is correct
5	Correct	760 ms	2624 KB	Output is correct
6	Correct	735 ms	2624 KB	Output is correct
7	Correct	766 ms	2804 KB	Output is correct
8	Correct	776 ms	2620 KB	Output is correct
9	Correct	797 ms	2632 KB	Output is correct
10	Correct	666 ms	2616 KB	Output is correct
11	Correct	669 ms	2624 KB	Output is correct
12	Correct	656 ms	2396 KB	Output is correct
13	Correct	688 ms	2396 KB	Output is correct
14	Correct	666 ms	2628 KB	Output is correct
15	Correct	641 ms	2620 KB	Output is correct
16	Correct	649 ms	2640 KB	Output is correct
17	Correct	649 ms	2392 KB	Output is correct
18	Correct	691 ms	2620 KB	Output is correct
19	Execution timed out	9036 ms	2904 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-