oj.uz

답안 #474870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474870 2021-09-20T08:19:46 Z NhatMinh0208 Bubble Sort 2 (JOI18_bubblesort2) C++17
38 / 100
 634 ms 64692 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
ll n,m,i,j,k,t,t1,u,v,a,b;
int arr[500001];
int cnt[500001];
set<ll,greater<ll>> bruh[101];
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V) {
    vector<int> res;

    n=A.size();
    m=V.size();
    for (i=0;i<n;i++) arr[i]=A[i];

    if (n<=8000) {
        for (i=0;i<n;i++) for (j=i+1;j<n;j++) if (arr[i]>arr[j]) cnt[j]++;
        for (j=0;j<m;j++) {
            for (i=X[j]+1;i<n;i++) if (arr[X[j]]>arr[i]) cnt[i]--;
            arr[X[j]]=V[j];
            for (i=X[j]+1;i<n;i++) if (arr[X[j]]>arr[i]) cnt[i]++;
            cnt[X[j]]=0;
            for (i=0;i<X[j];i++) if (arr[i]>arr[X[j]]) cnt[X[j]]++;     
            a=0;
            for (i=0;i<n;i++) a=max(a,cnt[i]);
            res.push_back(a);
        }
    } else {
        for (i=0;i<n;i++) {
            for (j=0;j<=100;j++) if (arr[i]<j) bruh[j].insert(i);
        }
        for (j=0;j<m;j++) {
            u=X[j];
            if (arr[u]>V[j]) {
                for (i=arr[u];i>V[j];i--) bruh[i].insert(u);
            }
            if (arr[u]<V[j]) {
                for (i=arr[u]+1;i<=V[j];i++) bruh[i].erase(u);
            }
            arr[u]=V[j];
            a=0;
            for (i=0;i<=100;i++) if (bruh[i].size()) {
                b=(*(bruh[i].begin()));
                a=max(a,n-bruh[i].size()-(n-b));
            }
            res.push_back(a);
        }
    }

    return res;
}
// N;   
// 5 6 3 4 1 2
// 5 3 4 1 2 6
// 3 4 1 2 5 6
// 1 2 3 4 5

Compilation message

bubblesort2.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:42:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'long long unsigned int' [-Wsign-compare]
   42 | #define max(a,b) (((a)>(b))?(a):(b))
      |                    ~~~^~~~
bubblesort2.cpp:140:19: note: in expansion of macro 'max'
  140 |                 a=max(a,n-bruh[i].size()-(n-b));
      |                   ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 32 ms 332 KB Output is correct
4 Correct 27 ms 372 KB Output is correct
5 Correct 23 ms 376 KB Output is correct
6 Correct 11 ms 392 KB Output is correct
7 Correct 18 ms 508 KB Output is correct
8 Correct 17 ms 392 KB Output is correct
9 Correct 20 ms 372 KB Output is correct
10 Correct 18 ms 332 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 18 ms 388 KB Output is correct
13 Correct 16 ms 388 KB Output is correct
14 Correct 16 ms 368 KB Output is correct
15 Correct 17 ms 380 KB Output is correct
16 Correct 16 ms 372 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 15 ms 380 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 32 ms 332 KB Output is correct
4 Correct 27 ms 372 KB Output is correct
5 Correct 23 ms 376 KB Output is correct
6 Correct 11 ms 392 KB Output is correct
7 Correct 18 ms 508 KB Output is correct
8 Correct 17 ms 392 KB Output is correct
9 Correct 20 ms 372 KB Output is correct
10 Correct 18 ms 332 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 18 ms 388 KB Output is correct
13 Correct 16 ms 388 KB Output is correct
14 Correct 16 ms 368 KB Output is correct
15 Correct 17 ms 380 KB Output is correct
16 Correct 16 ms 372 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 15 ms 380 KB Output is correct
19 Correct 349 ms 648 KB Output is correct
20 Correct 444 ms 556 KB Output is correct
21 Correct 229 ms 708 KB Output is correct
22 Correct 321 ms 552 KB Output is correct
23 Correct 275 ms 580 KB Output is correct
24 Correct 273 ms 580 KB Output is correct
25 Correct 247 ms 576 KB Output is correct
26 Correct 252 ms 548 KB Output is correct
27 Correct 230 ms 552 KB Output is correct
28 Correct 233 ms 592 KB Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 32 ms 332 KB Output is correct
4 Correct 27 ms 372 KB Output is correct
5 Correct 23 ms 376 KB Output is correct
6 Correct 11 ms 392 KB Output is correct
7 Correct 18 ms 508 KB Output is correct
8 Correct 17 ms 392 KB Output is correct
9 Correct 20 ms 372 KB Output is correct
10 Correct 18 ms 332 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 18 ms 388 KB Output is correct
13 Correct 16 ms 388 KB Output is correct
14 Correct 16 ms 368 KB Output is correct
15 Correct 17 ms 380 KB Output is correct
16 Correct 16 ms 372 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 15 ms 380 KB Output is correct
19 Correct 349 ms 648 KB Output is correct
20 Correct 444 ms 556 KB Output is correct
21 Correct 229 ms 708 KB Output is correct
22 Correct 321 ms 552 KB Output is correct
23 Correct 275 ms 580 KB Output is correct
24 Correct 273 ms 580 KB Output is correct
25 Correct 247 ms 576 KB Output is correct
26 Correct 252 ms 548 KB Output is correct
27 Correct 230 ms 552 KB Output is correct
28 Correct 233 ms 592 KB Output is correct
29 Incorrect 634 ms 64692 KB Output isn't correct
30 Halted 0 ms 0 KB -