oj.uz

답안 #733526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733526 2023-05-01T02:09:15 Z n0sk1ll Bubble Sort 2 (JOI18_bubblesort2) C++17
17 / 100
 7568 ms 1364 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;
    ///JEBEM TI MATER ZA SINTAKSU MARS U PICKU MATERINU
    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);

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

	return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 212 KB Output is correct
2 Correct 81 ms 340 KB Output is correct
3 Correct 533 ms 420 KB Output is correct
4 Correct 543 ms 432 KB Output is correct
5 Correct 489 ms 420 KB Output is correct
6 Correct 342 ms 416 KB Output is correct
7 Correct 418 ms 420 KB Output is correct
8 Correct 446 ms 420 KB Output is correct
9 Correct 483 ms 416 KB Output is correct
10 Correct 374 ms 436 KB Output is correct
11 Correct 354 ms 412 KB Output is correct
12 Correct 372 ms 412 KB Output is correct
13 Correct 361 ms 420 KB Output is correct
14 Correct 361 ms 412 KB Output is correct
15 Correct 349 ms 408 KB Output is correct
16 Correct 367 ms 416 KB Output is correct
17 Correct 364 ms 412 KB Output is correct
18 Correct 351 ms 416 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 212 KB Output is correct
2 Correct 81 ms 340 KB Output is correct
3 Correct 533 ms 420 KB Output is correct
4 Correct 543 ms 432 KB Output is correct
5 Correct 489 ms 420 KB Output is correct
6 Correct 342 ms 416 KB Output is correct
7 Correct 418 ms 420 KB Output is correct
8 Correct 446 ms 420 KB Output is correct
9 Correct 483 ms 416 KB Output is correct
10 Correct 374 ms 436 KB Output is correct
11 Correct 354 ms 412 KB Output is correct
12 Correct 372 ms 412 KB Output is correct
13 Correct 361 ms 420 KB Output is correct
14 Correct 361 ms 412 KB Output is correct
15 Correct 349 ms 408 KB Output is correct
16 Correct 367 ms 416 KB Output is correct
17 Correct 364 ms 412 KB Output is correct
18 Correct 351 ms 416 KB Output is correct
19 Incorrect 7568 ms 724 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 212 KB Output is correct
2 Correct 81 ms 340 KB Output is correct
3 Correct 533 ms 420 KB Output is correct
4 Correct 543 ms 432 KB Output is correct
5 Correct 489 ms 420 KB Output is correct
6 Correct 342 ms 416 KB Output is correct
7 Correct 418 ms 420 KB Output is correct
8 Correct 446 ms 420 KB Output is correct
9 Correct 483 ms 416 KB Output is correct
10 Correct 374 ms 436 KB Output is correct
11 Correct 354 ms 412 KB Output is correct
12 Correct 372 ms 412 KB Output is correct
13 Correct 361 ms 420 KB Output is correct
14 Correct 361 ms 412 KB Output is correct
15 Correct 349 ms 408 KB Output is correct
16 Correct 367 ms 416 KB Output is correct
17 Correct 364 ms 412 KB Output is correct
18 Correct 351 ms 416 KB Output is correct
19 Incorrect 7568 ms 724 KB Output isn't correct
20 Halted 0 ms 0 KB -