oj.uz

답안 #332305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332305 2020-12-02T02:28:45 Z YJU Bubble Sort 2 (JOI18_bubblesort2) C++14
0 / 100
 6248 ms 1500 KB 
#include<bits/stdc++.h>
#include "bubblesort2.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<<60);
#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(i,SZ(A))a.pb(mp(A[i],i));
		sort(a.begin(),a.end());
		REP(j,SZ(a))res=max(res,i-a[i].second);
		ans.pb(res);
	}
	return ans;
	
}

Compilation message

bubblesort2.cpp:13:18: warning: overflow in conversion from 'long long int' to 'll' {aka 'int'} changes value from '1152921504606846976' to '0' [-Woverflow]
   13 | const ll INF=(1LL<<60);
      |              ~~~~^~~~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 40.0

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