oj.uz

답안 #733638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733638 2023-05-01T06:02:00 Z n0sk1ll Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 450 ms 724 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[j]>a[i]) pom[i]++;

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

            pom[X[i]]=0;
            ff(j,0,X[i]) if (a[j]>a[X[i]]) pom[X[i]]++;

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

	return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 5 ms 324 KB Output is correct
3 Correct 28 ms 340 KB Output is correct
4 Correct 28 ms 340 KB Output is correct
5 Correct 22 ms 340 KB Output is correct
6 Correct 14 ms 360 KB Output is correct
7 Correct 17 ms 356 KB Output is correct
8 Correct 21 ms 340 KB Output is correct
9 Correct 26 ms 356 KB Output is correct
10 Correct 21 ms 360 KB Output is correct
11 Correct 19 ms 352 KB Output is correct
12 Correct 21 ms 360 KB Output is correct
13 Correct 18 ms 340 KB Output is correct
14 Correct 19 ms 320 KB Output is correct
15 Correct 19 ms 364 KB Output is correct
16 Correct 17 ms 356 KB Output is correct
17 Correct 17 ms 356 KB Output is correct
18 Correct 17 ms 356 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 5 ms 324 KB Output is correct
3 Correct 28 ms 340 KB Output is correct
4 Correct 28 ms 340 KB Output is correct
5 Correct 22 ms 340 KB Output is correct
6 Correct 14 ms 360 KB Output is correct
7 Correct 17 ms 356 KB Output is correct
8 Correct 21 ms 340 KB Output is correct
9 Correct 26 ms 356 KB Output is correct
10 Correct 21 ms 360 KB Output is correct
11 Correct 19 ms 352 KB Output is correct
12 Correct 21 ms 360 KB Output is correct
13 Correct 18 ms 340 KB Output is correct
14 Correct 19 ms 320 KB Output is correct
15 Correct 19 ms 364 KB Output is correct
16 Correct 17 ms 356 KB Output is correct
17 Correct 17 ms 356 KB Output is correct
18 Correct 17 ms 356 KB Output is correct
19 Correct 358 ms 496 KB Output is correct
20 Correct 450 ms 528 KB Output is correct
21 Correct 286 ms 724 KB Output is correct
22 Correct 366 ms 724 KB Output is correct
23 Correct 315 ms 688 KB Output is correct
24 Correct 295 ms 696 KB Output is correct
25 Correct 283 ms 688 KB Output is correct
26 Correct 280 ms 688 KB Output is correct
27 Correct 260 ms 684 KB Output is correct
28 Correct 260 ms 684 KB Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 5 ms 324 KB Output is correct
3 Correct 28 ms 340 KB Output is correct
4 Correct 28 ms 340 KB Output is correct
5 Correct 22 ms 340 KB Output is correct
6 Correct 14 ms 360 KB Output is correct
7 Correct 17 ms 356 KB Output is correct
8 Correct 21 ms 340 KB Output is correct
9 Correct 26 ms 356 KB Output is correct
10 Correct 21 ms 360 KB Output is correct
11 Correct 19 ms 352 KB Output is correct
12 Correct 21 ms 360 KB Output is correct
13 Correct 18 ms 340 KB Output is correct
14 Correct 19 ms 320 KB Output is correct
15 Correct 19 ms 364 KB Output is correct
16 Correct 17 ms 356 KB Output is correct
17 Correct 17 ms 356 KB Output is correct
18 Correct 17 ms 356 KB Output is correct
19 Correct 358 ms 496 KB Output is correct
20 Correct 450 ms 528 KB Output is correct
21 Correct 286 ms 724 KB Output is correct
22 Correct 366 ms 724 KB Output is correct
23 Correct 315 ms 688 KB Output is correct
24 Correct 295 ms 696 KB Output is correct
25 Correct 283 ms 688 KB Output is correct
26 Correct 280 ms 688 KB Output is correct
27 Correct 260 ms 684 KB Output is correct
28 Correct 260 ms 684 KB Output is correct
29 Incorrect 2 ms 468 KB Output isn't correct
30 Halted 0 ms 0 KB -