oj.uz

Submission #94595

# Submission time Handle Problem Language Result Execution time Memory
94595 2019-01-21T14:18:55 Z aminra Worst Reporter 3 (JOI18_worst_reporter3) C++14
12 / 100
 2000 ms 9348 KB 
//Smaug never desolated!!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = (int)5e5 + 7;
const int infint = (int)1e9 + 3;
const int MOD = (int)1e9 + 7;
const ll inf = (ll)1e18;
ll a[MAXN], n, tme[MAXN], Q;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> Q;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	tme[0] = 1;
	for (int i = 1; i <= n; i++)
	{
		ll tmp = (a[i] + tme[i - 1] - 1) / tme[i - 1];
		tme[i] = tme[i - 1] * tmp;
		if(tme[i] >= infint)	
			break;
	}
	for (int i = 0; i < Q; i++)
	{
		ll L, R, T;
		cin >> T >> L >> R;
		ll ans = 0;
		for (int j = 0; j <= n; j++)
		{
			if(tme[j] >= infint)
				break;
			ll cur = -j;
			cur += (T / tme[j]) * tme[j];
			ans += (L <= cur && cur <= R);
		}
		cout << ans << "\n";
	}
}

Subtask #1
0 / 7.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 376 KB Output is correct
2 Correct 14 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 14 ms 380 KB Output is correct
5 Correct 13 ms 376 KB Output is correct
6 Correct 13 ms 376 KB Output is correct

Subtask #3
0 / 81.0

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