oj.uz

Submission #110411

# Submission time Handle Problem Language Result Execution time Memory
110411 2019-05-10T19:27:48 Z ioilolcom Rice Hub (IOI11_ricehub) C++14
17 / 100
 1000 ms 1096 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define endl "\n"
#define x first
#define y second
#define pii pair<int,int>
typedef long long int ll;




vector<int> v;
int besthub(int R, int L, int X[], long long B)
{
	int n=R;
	ll w=B;
	v.resize(n+1);
	for(int i=0; i<n; i++) {
		v[i+1]=X[i];
	}
	int mx=0;
	for(int idx=1; idx<=n; idx++) {
		vector<pii> l,r;
		int cur=0;
		int curv=0;
		for(int i=idx+1; i<=n; i++) {
			curv+=v[i]-v[idx];
			cur++;
			r.push_back({curv,cur});
		}
		r.push_back({0,0});
		l.push_back({0,0});
		cur=0;
		curv=0;
		for(int i=idx-1; i>=0; i--) {
			curv+=abs(v[i]-v[idx]);
			cur++;
			l.push_back({curv,cur});
		}
		int ans=0;
		for(pii u:l) {
			for(pii v:r) {
				if(u.x+v.x<=w) {
					ans=max(ans,u.y+v.y);
				}
			}
		}
		ans++;
		mx=max(mx,ans);
	}
	return mx;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 165 ms 520 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 1096 KB Time limit exceeded
2 Halted 0 ms 0 KB -