oj.uz

Submission #49355

# Submission time Handle Problem Language Result Execution time Memory
49355 2018-05-27T05:06:34 Z gs13068 Worst Reporter 3 (JOI18_worst_reporter3) C++17
100 / 100
 847 ms 106684 KB 
#include <cstdio>

int n;
int a[500005];

inline int f(int T, int X) {
	int L, R, M;
	L = 0;
	R = n + 1;
	while (L < R) {
		M = L + R >> 1;
		if (T / a[M] * a[M] - M >= X) L = M + 1;
		else R = M;
	}
	return L;
}

int main() {
	int i, j, k, m;
	scanf("%d%d", &n, &m);
	a[0] = 1;
	for (i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		a[i] = ((a[i] - 1) / a[i - 1] + 1) * a[i - 1];
	}
	while (m--) {
		scanf("%d%d%d", &i, &j, &k);
		printf("%d\n", f(i, j) - f(i, k + 1));
	}
}

Compilation message

worst_reporter3.cpp: In function 'int f(int, int)':
worst_reporter3.cpp:11:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   M = L + R >> 1;
       ~~^~~
worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
worst_reporter3.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
worst_reporter3.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &i, &j, &k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 847 ms 5428 KB Output is correct
2 Correct 731 ms 5428 KB Output is correct
3 Correct 772 ms 5428 KB Output is correct
4 Correct 721 ms 5428 KB Output is correct
5 Correct 824 ms 5508 KB Output is correct
6 Correct 768 ms 5508 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 847 ms 5428 KB Output is correct
2 Correct 731 ms 5428 KB Output is correct
3 Correct 772 ms 5428 KB Output is correct
4 Correct 721 ms 5428 KB Output is correct
5 Correct 824 ms 5508 KB Output is correct
6 Correct 768 ms 5508 KB Output is correct
7 Correct 3 ms 5508 KB Output is correct
8 Correct 3 ms 5508 KB Output is correct
9 Correct 3 ms 5508 KB Output is correct
10 Correct 3 ms 5508 KB Output is correct
11 Correct 3 ms 5508 KB Output is correct
12 Correct 3 ms 5508 KB Output is correct
13 Correct 475 ms 19452 KB Output is correct
14 Correct 550 ms 35956 KB Output is correct
15 Correct 543 ms 51208 KB Output is correct
16 Correct 526 ms 67016 KB Output is correct
17 Correct 679 ms 87000 KB Output is correct
18 Correct 671 ms 105604 KB Output is correct
19 Correct 588 ms 106196 KB Output is correct
20 Correct 581 ms 106196 KB Output is correct
21 Correct 655 ms 106196 KB Output is correct
22 Correct 831 ms 106196 KB Output is correct
23 Correct 722 ms 106300 KB Output is correct
24 Correct 715 ms 106300 KB Output is correct
25 Correct 780 ms 106684 KB Output is correct
26 Correct 769 ms 106684 KB Output is correct
27 Correct 704 ms 106684 KB Output is correct
28 Correct 625 ms 106684 KB Output is correct
29 Correct 658 ms 106684 KB Output is correct
30 Correct 778 ms 106684 KB Output is correct
31 Correct 696 ms 106684 KB Output is correct
32 Correct 627 ms 106684 KB Output is correct
33 Correct 2 ms 106684 KB Output is correct