oj.uz

Submission #121869

# Submission time Handle Problem Language Result Execution time Memory
121869 2019-06-27T07:01:48 Z turbat Sails (IOI07_sails) C++14
90 / 100
 1000 ms 2688 KB 
#include <bits/stdc++.h>
using namespace std;
#define N 100005
 
int n, mh;
long long  sum, cnt[N], s[N], ans, p, uld, avr;
pair <int, int> mast[N];
 
inline void solve (int l){
	if (l > mh) return;
	p = l;
	long long th = mh;
	while (!cnt[p]) p++;
	for (int i = p + 1;i <= th;i++){
		if((s[i] - s[l - 1]) * (p - l + 1) >= (s[p] - s[l - 1]) * (i - l + 1)){
			p = i;
			long long nw = l - 1 + ((s[th] - s[l - 1]) * (i - l + 1)) / (s[i] - s[l - 1]);
			while (nw < th){
				th = nw;
				nw = l - 1 + ((s[th] - s[l - 1]) * (i - l + 1)) / (s[i] - s[l - 1]);
			}
		}
		if ((s[th] - s[l - 1]) * (p - l + 1) <= (s[p] - s[l - 1]) * (i - l + 2))
			break;
	}	
	sum = s[p] - s[l - 1];
	avr = sum / (p - l + 1);
	uld = sum % (p - l + 1);
	ans += uld * avr;
	ans += (p - l + 1) * avr * (avr - 1) / 2;
	solve (p + 1);
}
 
int main (){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	cin >> n;
	for (int i = 0;i < n;i++){
		cin >> mast[i].first>> mast[i].second;
		mh = max(mh, mast[i].first);
		cnt[mast[i].first + 1]--;
		cnt[mast[i].first - mast[i].second + 1]++;
	}
	for (int i = 1;i <= mh;i++) { 
		cnt[i] += cnt[i - 1];
		s[i] = s[i - 1] + cnt[i];
	}
	solve (1);
	cout << ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 896 KB Output is correct
2 Correct 9 ms 640 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 1104 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 1568 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2432 KB Output is correct
2 Correct 19 ms 2560 KB Output is correct

Subtask #10
0 / 10.0

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

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 2688 KB Output is correct
2 Correct 18 ms 1664 KB Output is correct