oj.uz

Submission #733524

# Submission time Handle Problem Language Result Execution time Memory
733524 2023-05-01T02:00:18 Z n0sk1ll Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
 31 ms 656 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

#include "bubblesort2.h"

const int N=6003;
int fwt[N+3];

void add(int i, int x)
{
    for (;i<=N;i+=(i&=i)) fwt[i]+=x;
}

int pre(int i)
{
    int ret=0;
    for (;i;i-=(i&-i)) ret+=fwt[i];
    return ret;
}

int solve(vector<int> a, int n)
{
    vector<int> sorta=a;
    sort(all(sorta));

    ff(i,0,n) a[i]=lower_bound(all(sorta),a[i])-sorta.begin()+1;

    int ret=0;
    ff(i,0,n)
    {
        ret=max(ret,i-pre(a[i]));
        add(a[i],1);
    }

    fff(i,1,N) fwt[i]=0;

    return ret;
}

vector<int> countScans(vector<int> a, vector<int> X, vector<int> V)
{
    int n=(int)a.size();
	int q=(int)X.size();
	vector<int> ans(q,0);

	if (n>2000 || q>2000) return ans;

	ff(i,0,q)
	{
	    a[X[i]]=V[i];
	    ans[i]=solve(a,n);
	}

	return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

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