oj.uz

Submission #24586

# Submission time Handle Problem Language Result Execution time Memory
24586 2017-06-10T13:45:32 Z gs14004 Shortcut (IOI16_shortcut) C++11
0 / 100
 0 ms 17648 KB 
#include "shortcut.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<lint, lint> pi;

int n, c;
lint a[1000005], b[1000005];

bool trial(lint x){
	lint ps = -1e18, pe = 1e18, ms = -1e18, me = 1e18;
	lint mxp = -1e18, mnp = 1e18, mxm = -1e18, mnm = 1e18;
	vector<pi> v, w;
	for(int i=0; i<n; i++) v.push_back(pi(a[i] + b[i], i));
	for(int i=0; i<n; i++) w.push_back(pi(x + -a[i] + b[i], i));
	sort(v.begin(), v.end());
	sort(w.begin(), w.end());
	int p = 0;
	for(int i=0; i<n; i++){
		while(p < n && w[p].first < v[i].first){
			mxp = max(mxp, a[w[p].second] + b[w[p].second]);
			mxm = max(mxm, -a[w[p].second] + b[w[p].second]);
			mnp = min(mnp, a[w[p].second] + b[w[p].second]);
			mnm = min(mnm, -a[w[p].second] + b[w[p].second]);
          	p++;
		}
		ps = max(ps, mxp - x + c + b[v[i].second] + a[v[i].second]);
		pe = min(pe, mnm + x - c + b[v[i].second] - a[v[i].second]);
		ms = max(ms, mxp - x + c - b[v[i].second] + a[v[i].second]);
		me = min(me, mnm + x - c - b[v[i].second] - a[v[i].second]);
	}
	/*
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
			if(b[j] + a[j] > x + b[i] - a[i]){
				lint r = x - c - a[i] - a[j];
				ps = max(ps, b[i] + a[i] - x + c + b[j] + a[j]);
				pe = min(pe, b[i] - a[i] + x - c + b[j] - a[j]);
				ms = max(ms, b[i] + a[i] - x + c - b[j] + a[j]);
				me = min(me, b[i] - a[i] + x - c - b[j] - a[j]);
			}
		}
	}*/
	for(int i=0; i<n; i++){
		lint s = max(ps - b[i], b[i] - me);
		lint e = min(pe - b[i], b[i] - ms);
		if(s <= e && upper_bound(b, b+n, e) != lower_bound(b, b+n, s)) return true;
	}
	return false;
}

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
	::n = n;
	::c = c;
	for(int i=0; i<n; i++){
		a[i] = d[i];
		if(i >= 1) b[i] = b[i-1] + l[i-1];
	}
	lint s = 0, e = 1e16;
	while(s != e){
		lint m = (s+e)/2;
		if(trial(m)) e = m;
		else s = m+1;
	}
	return s;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17648 KB n = 4, 80 is a correct answer
2 Correct 0 ms 17648 KB n = 9, 110 is a correct answer
3 Correct 0 ms 17648 KB n = 4, 21 is a correct answer
4 Correct 0 ms 17648 KB n = 3, 4 is a correct answer
5 Incorrect 0 ms 17648 KB n = 2, incorrect answer: jury 62 vs contestant 72
6 Halted 0 ms 0 KB -