oj.uz

Submission #884095

# Submission time Handle Problem Language Result Execution time Memory
884095 2023-12-06T15:51:57 Z vjudge1 Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 3385 ms 12896 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<pair<int,int>, null_type, less<pair<int,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;
}
ordered_set s;
set<int> pozs[105];
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);
	if(n<=8000)
    {
        for(int i=0;i<q;i++)
        {
            a[qp[i]] = qv[i];
            answer[i] = calcmax();
        }
    }
    else
    {
        for(int i=0;i<n;i++)
        {
            s.insert({a[i],i});
            pozs[a[i]].insert(i);
        }
        for(int i=0;i<q;i++)
        {
            pozs[a[qp[i]]].erase(qp[i]);
            s.erase({a[qp[i]],qp[i]});
            a[qp[i]] = qv[i];
            s.insert({a[qp[i]],qp[i]});
            pozs[a[qp[i]]].insert(qp[i]);
            int mxm=0;
            for(int j=0;j<=100;j++)
            {
                if(pozs[j].empty())
                    continue;
                auto it = pozs[j].rbegin();
                int x = *it;
                //for(auto x:pozs[j])
                    mxm = max(mxm, x - (int)s.order_of_key({a[x],x}));
            }
            answer[i] = mxm;
        }
    }
	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 2392 KB Output is correct
2 Correct 29 ms 2396 KB Output is correct
3 Correct 183 ms 2544 KB Output is correct
4 Correct 171 ms 2396 KB Output is correct
5 Correct 175 ms 2396 KB Output is correct
6 Correct 135 ms 2800 KB Output is correct
7 Correct 151 ms 2552 KB Output is correct
8 Correct 157 ms 2548 KB Output is correct
9 Correct 171 ms 2548 KB Output is correct
10 Correct 105 ms 2548 KB Output is correct
11 Correct 100 ms 2396 KB Output is correct
12 Correct 95 ms 2396 KB Output is correct
13 Correct 103 ms 2648 KB Output is correct
14 Correct 94 ms 2396 KB Output is correct
15 Correct 111 ms 2396 KB Output is correct
16 Correct 87 ms 2396 KB Output is correct
17 Correct 89 ms 2392 KB Output is correct
18 Correct 85 ms 2396 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2392 KB Output is correct
2 Correct 29 ms 2396 KB Output is correct
3 Correct 183 ms 2544 KB Output is correct
4 Correct 171 ms 2396 KB Output is correct
5 Correct 175 ms 2396 KB Output is correct
6 Correct 135 ms 2800 KB Output is correct
7 Correct 151 ms 2552 KB Output is correct
8 Correct 157 ms 2548 KB Output is correct
9 Correct 171 ms 2548 KB Output is correct
10 Correct 105 ms 2548 KB Output is correct
11 Correct 100 ms 2396 KB Output is correct
12 Correct 95 ms 2396 KB Output is correct
13 Correct 103 ms 2648 KB Output is correct
14 Correct 94 ms 2396 KB Output is correct
15 Correct 111 ms 2396 KB Output is correct
16 Correct 87 ms 2396 KB Output is correct
17 Correct 89 ms 2392 KB Output is correct
18 Correct 85 ms 2396 KB Output is correct
19 Correct 2559 ms 2724 KB Output is correct
20 Correct 3385 ms 2760 KB Output is correct
21 Correct 2879 ms 2756 KB Output is correct
22 Correct 3277 ms 2760 KB Output is correct
23 Correct 1889 ms 2904 KB Output is correct
24 Correct 1867 ms 2764 KB Output is correct
25 Correct 1837 ms 2764 KB Output is correct
26 Correct 1977 ms 2756 KB Output is correct
27 Correct 1864 ms 2764 KB Output is correct
28 Correct 1855 ms 2764 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5664 KB Output is correct
2 Correct 204 ms 7644 KB Output is correct
3 Correct 400 ms 9356 KB Output is correct
4 Correct 395 ms 9304 KB Output is correct
5 Correct 405 ms 9336 KB Output is correct
6 Correct 366 ms 9296 KB Output is correct
7 Correct 354 ms 9344 KB Output is correct
8 Correct 430 ms 9336 KB Output is correct
9 Correct 416 ms 9344 KB Output is correct
10 Correct 179 ms 9344 KB Output is correct
11 Correct 181 ms 9296 KB Output is correct
12 Correct 183 ms 9344 KB Output is correct
13 Correct 182 ms 9340 KB Output is correct
14 Correct 183 ms 9300 KB Output is correct
15 Correct 213 ms 9192 KB Output is correct
16 Correct 210 ms 9340 KB Output is correct
17 Correct 212 ms 9340 KB Output is correct
18 Correct 184 ms 9352 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2392 KB Output is correct
2 Correct 29 ms 2396 KB Output is correct
3 Correct 183 ms 2544 KB Output is correct
4 Correct 171 ms 2396 KB Output is correct
5 Correct 175 ms 2396 KB Output is correct
6 Correct 135 ms 2800 KB Output is correct
7 Correct 151 ms 2552 KB Output is correct
8 Correct 157 ms 2548 KB Output is correct
9 Correct 171 ms 2548 KB Output is correct
10 Correct 105 ms 2548 KB Output is correct
11 Correct 100 ms 2396 KB Output is correct
12 Correct 95 ms 2396 KB Output is correct
13 Correct 103 ms 2648 KB Output is correct
14 Correct 94 ms 2396 KB Output is correct
15 Correct 111 ms 2396 KB Output is correct
16 Correct 87 ms 2396 KB Output is correct
17 Correct 89 ms 2392 KB Output is correct
18 Correct 85 ms 2396 KB Output is correct
19 Correct 2559 ms 2724 KB Output is correct
20 Correct 3385 ms 2760 KB Output is correct
21 Correct 2879 ms 2756 KB Output is correct
22 Correct 3277 ms 2760 KB Output is correct
23 Correct 1889 ms 2904 KB Output is correct
24 Correct 1867 ms 2764 KB Output is correct
25 Correct 1837 ms 2764 KB Output is correct
26 Correct 1977 ms 2756 KB Output is correct
27 Correct 1864 ms 2764 KB Output is correct
28 Correct 1855 ms 2764 KB Output is correct
29 Correct 31 ms 5664 KB Output is correct
30 Correct 204 ms 7644 KB Output is correct
31 Correct 400 ms 9356 KB Output is correct
32 Correct 395 ms 9304 KB Output is correct
33 Correct 405 ms 9336 KB Output is correct
34 Correct 366 ms 9296 KB Output is correct
35 Correct 354 ms 9344 KB Output is correct
36 Correct 430 ms 9336 KB Output is correct
37 Correct 416 ms 9344 KB Output is correct
38 Correct 179 ms 9344 KB Output is correct
39 Correct 181 ms 9296 KB Output is correct
40 Correct 183 ms 9344 KB Output is correct
41 Correct 182 ms 9340 KB Output is correct
42 Correct 183 ms 9300 KB Output is correct
43 Correct 213 ms 9192 KB Output is correct
44 Correct 210 ms 9340 KB Output is correct
45 Correct 212 ms 9340 KB Output is correct
46 Correct 184 ms 9352 KB Output is correct
47 Runtime error 52 ms 12896 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -