oj.uz

답안 #976543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976543 2024-05-06T16:58:33 Z thegamercoder19 쌀 창고 (IOI11_ricehub) C++14
0 / 100
 1000 ms 604 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
int besthub(int n, int m, int X[], long long c)
{
	V<ll> pf(n + 1), a(n + 1);
	FOR(ll, i, 1, n + 1, 1)a[i] = X[i - 1], pf[i] = pf[i - 1] + a[i];
	ll ans = 0;
	FOR(ll,i,1,n+1,1)
	{
		ll cnt = 0, res = 0;
		FOR(ll, j, 1, n + 1, 1)
		{
			ll b = j, e = b;
			WH(b <= e && e<=n && b<= n)
			{
				if (res + abs(a[i] - a[e]) <= c)
				{
					res += abs(a[i] - a[e]), cnt++, e++;
					ans = max(ans, cnt);
				}
				else res -= abs(a[i] - a[b]), cnt--, b++;
			}
			j = e;
		}
		
	}
	RET ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1068 ms 604 KB Time limit exceeded
2 Halted 0 ms 0 KB -