oj.uz

답안 #332312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332312 2020-12-02T02:44:47 Z YJU Bubble Sort 2 (JOI18_bubblesort2) C++14
38 / 100
 9000 ms 2244 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e5+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<30);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()



vector<ll> countScans(vector<ll> A,vector<ll> X,vector<ll> V){
	vector<ll> ans;
	REP(i,SZ(X)){
		A[X[i]]=V[i];
		vector<pll> a;
		ll res=0;
		REP(j,SZ(A))a.pb(mp(A[j],j));
		sort(a.begin(),a.end());
		REP(j,SZ(a))res=max(res,a[j].second-j);
		ans.pb(res);
	}
	return ans;
}

/*
int main(){
	vector<ll> A,X,V;
	ll n,q,x;
	cin>>n>>q;
	REP(i,n)cin>>x,A.pb(x);
	REP(i,q)cin>>x,X.pb(x),cin>>x,V.pb(x);
	vector<ll> ans=countScans(A,X,V);
	for(ll i:ans)cout<<i<<"\n";
}
//*/

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 364 KB Output is correct
2 Correct 40 ms 384 KB Output is correct
3 Correct 262 ms 452 KB Output is correct
4 Correct 243 ms 364 KB Output is correct
5 Correct 231 ms 364 KB Output is correct
6 Correct 161 ms 492 KB Output is correct
7 Correct 201 ms 364 KB Output is correct
8 Correct 220 ms 364 KB Output is correct
9 Correct 234 ms 364 KB Output is correct
10 Correct 146 ms 364 KB Output is correct
11 Correct 145 ms 492 KB Output is correct
12 Correct 145 ms 492 KB Output is correct
13 Correct 146 ms 384 KB Output is correct
14 Correct 144 ms 364 KB Output is correct
15 Correct 153 ms 384 KB Output is correct
16 Correct 130 ms 364 KB Output is correct
17 Correct 132 ms 364 KB Output is correct
18 Correct 129 ms 492 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 364 KB Output is correct
2 Correct 40 ms 384 KB Output is correct
3 Correct 262 ms 452 KB Output is correct
4 Correct 243 ms 364 KB Output is correct
5 Correct 231 ms 364 KB Output is correct
6 Correct 161 ms 492 KB Output is correct
7 Correct 201 ms 364 KB Output is correct
8 Correct 220 ms 364 KB Output is correct
9 Correct 234 ms 364 KB Output is correct
10 Correct 146 ms 364 KB Output is correct
11 Correct 145 ms 492 KB Output is correct
12 Correct 145 ms 492 KB Output is correct
13 Correct 146 ms 384 KB Output is correct
14 Correct 144 ms 364 KB Output is correct
15 Correct 153 ms 384 KB Output is correct
16 Correct 130 ms 364 KB Output is correct
17 Correct 132 ms 364 KB Output is correct
18 Correct 129 ms 492 KB Output is correct
19 Correct 3514 ms 916 KB Output is correct
20 Correct 4726 ms 748 KB Output is correct
21 Correct 3993 ms 948 KB Output is correct
22 Correct 4526 ms 836 KB Output is correct
23 Correct 2707 ms 748 KB Output is correct
24 Correct 2750 ms 820 KB Output is correct
25 Correct 2681 ms 760 KB Output is correct
26 Correct 2704 ms 908 KB Output is correct
27 Correct 2699 ms 820 KB Output is correct
28 Correct 2692 ms 900 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6226 ms 1392 KB Output is correct
2 Execution timed out 9097 ms 2244 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 364 KB Output is correct
2 Correct 40 ms 384 KB Output is correct
3 Correct 262 ms 452 KB Output is correct
4 Correct 243 ms 364 KB Output is correct
5 Correct 231 ms 364 KB Output is correct
6 Correct 161 ms 492 KB Output is correct
7 Correct 201 ms 364 KB Output is correct
8 Correct 220 ms 364 KB Output is correct
9 Correct 234 ms 364 KB Output is correct
10 Correct 146 ms 364 KB Output is correct
11 Correct 145 ms 492 KB Output is correct
12 Correct 145 ms 492 KB Output is correct
13 Correct 146 ms 384 KB Output is correct
14 Correct 144 ms 364 KB Output is correct
15 Correct 153 ms 384 KB Output is correct
16 Correct 130 ms 364 KB Output is correct
17 Correct 132 ms 364 KB Output is correct
18 Correct 129 ms 492 KB Output is correct
19 Correct 3514 ms 916 KB Output is correct
20 Correct 4726 ms 748 KB Output is correct
21 Correct 3993 ms 948 KB Output is correct
22 Correct 4526 ms 836 KB Output is correct
23 Correct 2707 ms 748 KB Output is correct
24 Correct 2750 ms 820 KB Output is correct
25 Correct 2681 ms 760 KB Output is correct
26 Correct 2704 ms 908 KB Output is correct
27 Correct 2699 ms 820 KB Output is correct
28 Correct 2692 ms 900 KB Output is correct
29 Correct 6226 ms 1392 KB Output is correct
30 Execution timed out 9097 ms 2244 KB Time limit exceeded
31 Halted 0 ms 0 KB -