oj.uz

Submission #884072

# Submission time Handle Problem Language Result Execution time Memory
884072 2023-12-06T15:28:47 Z vjudge1 Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 9000 ms 5468 KB 
#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 init[500005];
/*struct node
{
    int val;
    int lazy;
    int tole;
    int tori;
};
vector<node> aint[2000005];

void propagate_mare(int nod)
{

}
void propagate_mic(int nod, int c)
{

}

void upd_mare_plus(int nod, int st, int dr, int le, int ri, int newv)
{

}
void upd_mic_plus(int nod, int st, int dr, int le, int ri, int newv, int c)
{

}

void upd_mare_egal(int nod, int st, int dr, int le, int ri, int newv)
{

}
void upd_mic_egal(int nod, int st, int dr, int le, int ri, int newv, int c)
{

}*/
pair<int,int> v[500005];
int calcmax()
{
    for(int i=0;i<n;i++)
    {
        v[i] = {a[i],i};
    }
    sort(v,v+n);
    int mxm=0;
    for(int i=0;i<n;i++)
    {
        mxm = max(mxm, v[i].second - i);
    }
    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 10 ms 2396 KB Output is correct
2 Correct 26 ms 2516 KB Output is correct
3 Correct 178 ms 2396 KB Output is correct
4 Correct 176 ms 2392 KB Output is correct
5 Correct 171 ms 2536 KB Output is correct
6 Correct 101 ms 2396 KB Output is correct
7 Correct 142 ms 2544 KB Output is correct
8 Correct 164 ms 2540 KB Output is correct
9 Correct 181 ms 2540 KB Output is correct
10 Correct 110 ms 2648 KB Output is correct
11 Correct 97 ms 2540 KB Output is correct
12 Correct 118 ms 2540 KB Output is correct
13 Correct 99 ms 2536 KB Output is correct
14 Correct 108 ms 2904 KB Output is correct
15 Correct 106 ms 2540 KB Output is correct
16 Correct 90 ms 2392 KB Output is correct
17 Correct 116 ms 2536 KB Output is correct
18 Correct 83 ms 2540 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2396 KB Output is correct
2 Correct 26 ms 2516 KB Output is correct
3 Correct 178 ms 2396 KB Output is correct
4 Correct 176 ms 2392 KB Output is correct
5 Correct 171 ms 2536 KB Output is correct
6 Correct 101 ms 2396 KB Output is correct
7 Correct 142 ms 2544 KB Output is correct
8 Correct 164 ms 2540 KB Output is correct
9 Correct 181 ms 2540 KB Output is correct
10 Correct 110 ms 2648 KB Output is correct
11 Correct 97 ms 2540 KB Output is correct
12 Correct 118 ms 2540 KB Output is correct
13 Correct 99 ms 2536 KB Output is correct
14 Correct 108 ms 2904 KB Output is correct
15 Correct 106 ms 2540 KB Output is correct
16 Correct 90 ms 2392 KB Output is correct
17 Correct 116 ms 2536 KB Output is correct
18 Correct 83 ms 2540 KB Output is correct
19 Correct 2618 ms 2716 KB Output is correct
20 Correct 3457 ms 2748 KB Output is correct
21 Correct 2879 ms 2752 KB Output is correct
22 Correct 3417 ms 2836 KB Output is correct
23 Correct 2003 ms 2748 KB Output is correct
24 Correct 1953 ms 2744 KB Output is correct
25 Correct 1945 ms 2904 KB Output is correct
26 Correct 1950 ms 2748 KB Output is correct
27 Correct 1922 ms 2744 KB Output is correct
28 Correct 2037 ms 2744 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4499 ms 4956 KB Output is correct
2 Execution timed out 9054 ms 5468 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2396 KB Output is correct
2 Correct 26 ms 2516 KB Output is correct
3 Correct 178 ms 2396 KB Output is correct
4 Correct 176 ms 2392 KB Output is correct
5 Correct 171 ms 2536 KB Output is correct
6 Correct 101 ms 2396 KB Output is correct
7 Correct 142 ms 2544 KB Output is correct
8 Correct 164 ms 2540 KB Output is correct
9 Correct 181 ms 2540 KB Output is correct
10 Correct 110 ms 2648 KB Output is correct
11 Correct 97 ms 2540 KB Output is correct
12 Correct 118 ms 2540 KB Output is correct
13 Correct 99 ms 2536 KB Output is correct
14 Correct 108 ms 2904 KB Output is correct
15 Correct 106 ms 2540 KB Output is correct
16 Correct 90 ms 2392 KB Output is correct
17 Correct 116 ms 2536 KB Output is correct
18 Correct 83 ms 2540 KB Output is correct
19 Correct 2618 ms 2716 KB Output is correct
20 Correct 3457 ms 2748 KB Output is correct
21 Correct 2879 ms 2752 KB Output is correct
22 Correct 3417 ms 2836 KB Output is correct
23 Correct 2003 ms 2748 KB Output is correct
24 Correct 1953 ms 2744 KB Output is correct
25 Correct 1945 ms 2904 KB Output is correct
26 Correct 1950 ms 2748 KB Output is correct
27 Correct 1922 ms 2744 KB Output is correct
28 Correct 2037 ms 2744 KB Output is correct
29 Correct 4499 ms 4956 KB Output is correct
30 Execution timed out 9054 ms 5468 KB Time limit exceeded
31 Halted 0 ms 0 KB -