oj.uz

답안 #330299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330299 2020-11-24T14:25:02 Z NhatMinh0208 쌀 창고 (IOI11_ricehub) C++14
0 / 100
 3 ms 492 KB 
/*
	Normie's Template v2.0
*/
 
// 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 tree<long long,null_type,less<long long>,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.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,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);cout.tie(0)
#define nfio cin.tie(0);cout.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))
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//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;
//---------END-------//
 
int besthub(int n, int L, int X[], long long B){  
	sort(X,X+n);
	ll l,r,m,i,j,k,el,er;
	ll pre[n+1];
	l=1;r=n;
	pre[0]=0;
	for (i=1;i<=n;i++) pre[i]=pre[i-1]+X[i-1];
	while (l<r)
	{
		ll mid=(l+r)/2+1,done=0,cur;
		for (el=1;el+mid-1<=n;el++)
		{
			cur=0;
			er=el+mid-1;
			if (el+mid/2>=el)
			cur+=(ll)X[el+mid/2]*(mid/2+1)-pre[el+mid/2+1]+pre[el];
			if (er>=el+mid/2+1)
			cur+=pre[er+1]-pre[el+mid/2+1]-(ll)X[el+mid/2]*(mid-mid/2-1);
			if (cur<=B) done=1;
		}
		if (done) l=mid; else r=mid-1;
	}
  return X[l];
}

Compilation message

ricehub.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      | 
ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:71:9: warning: unused variable 'm' [-Wunused-variable]
   71 |  ll l,r,m,i,j,k,el,er;
      |         ^
ricehub.cpp:71:13: warning: unused variable 'j' [-Wunused-variable]
   71 |  ll l,r,m,i,j,k,el,er;
      |             ^
ricehub.cpp:71:15: warning: unused variable 'k' [-Wunused-variable]
   71 |  ll l,r,m,i,j,k,el,er;
      |               ^

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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