oj.uz

답안 #474838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474838 2021-09-20T03:52:36 Z NhatMinh0208 Bubble Sort 2 (JOI18_bubblesort2) C++14
17 / 100
 9000 ms 1216 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[10001];
ordered_set(ll) lmao;
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];
    for (j=0;j<m;j++) {
        arr[X[j]]=V[j];
        u=1e9+1;
        a=0;
        lmao.clear();
        for (i=0;i<n;i++) {
            v=((ll)(arr[i])<<16)^(i);
            // cout<<v<<endl;
            u=lmao.size()-lmao.order_of_key(v);
            lmao.insert(v);
            a=max(a,u);
        }
        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")
      |

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 332 KB Output is correct
2 Correct 161 ms 372 KB Output is correct
3 Correct 1117 ms 512 KB Output is correct
4 Correct 1083 ms 580 KB Output is correct
5 Correct 1054 ms 636 KB Output is correct
6 Correct 1074 ms 644 KB Output is correct
7 Correct 1121 ms 708 KB Output is correct
8 Correct 1131 ms 528 KB Output is correct
9 Correct 1122 ms 524 KB Output is correct
10 Correct 946 ms 508 KB Output is correct
11 Correct 947 ms 580 KB Output is correct
12 Correct 948 ms 624 KB Output is correct
13 Correct 935 ms 620 KB Output is correct
14 Correct 967 ms 500 KB Output is correct
15 Correct 927 ms 580 KB Output is correct
16 Correct 943 ms 744 KB Output is correct
17 Correct 974 ms 636 KB Output is correct
18 Correct 959 ms 620 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 332 KB Output is correct
2 Correct 161 ms 372 KB Output is correct
3 Correct 1117 ms 512 KB Output is correct
4 Correct 1083 ms 580 KB Output is correct
5 Correct 1054 ms 636 KB Output is correct
6 Correct 1074 ms 644 KB Output is correct
7 Correct 1121 ms 708 KB Output is correct
8 Correct 1131 ms 528 KB Output is correct
9 Correct 1122 ms 524 KB Output is correct
10 Correct 946 ms 508 KB Output is correct
11 Correct 947 ms 580 KB Output is correct
12 Correct 948 ms 624 KB Output is correct
13 Correct 935 ms 620 KB Output is correct
14 Correct 967 ms 500 KB Output is correct
15 Correct 927 ms 580 KB Output is correct
16 Correct 943 ms 744 KB Output is correct
17 Correct 974 ms 636 KB Output is correct
18 Correct 959 ms 620 KB Output is correct
19 Execution timed out 9029 ms 1216 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 332 KB Output is correct
2 Correct 161 ms 372 KB Output is correct
3 Correct 1117 ms 512 KB Output is correct
4 Correct 1083 ms 580 KB Output is correct
5 Correct 1054 ms 636 KB Output is correct
6 Correct 1074 ms 644 KB Output is correct
7 Correct 1121 ms 708 KB Output is correct
8 Correct 1131 ms 528 KB Output is correct
9 Correct 1122 ms 524 KB Output is correct
10 Correct 946 ms 508 KB Output is correct
11 Correct 947 ms 580 KB Output is correct
12 Correct 948 ms 624 KB Output is correct
13 Correct 935 ms 620 KB Output is correct
14 Correct 967 ms 500 KB Output is correct
15 Correct 927 ms 580 KB Output is correct
16 Correct 943 ms 744 KB Output is correct
17 Correct 974 ms 636 KB Output is correct
18 Correct 959 ms 620 KB Output is correct
19 Execution timed out 9029 ms 1216 KB Time limit exceeded
20 Halted 0 ms 0 KB -