oj.uz

답안 #733633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733633 2023-05-01T05:59:02 Z n0sk1ll Bubble Sort 2 (JOI18_bubblesort2) C++17
0 / 100
 3 ms 556 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"

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<=8000 && q<=8000)
    {
        vector<int> pom(n,0);
        ff(i,0,n) ff(j,0,i) if (a[i]>a[j]) pom[i]++;

        ff(i,0,q)
        {
            ff(j,i+1,n) if (a[i]>a[j]) pom[j]--;
            a[X[i]]=V[i];
            ff(j,i+1,n) if (a[i]>a[j]) pom[j]++;

            int mx=0;
            ff(j,0,n) mx=max(mx,pom[j]);
            ans[i]=mx;
        }
    }

	return ans;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 556 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -