oj.uz

답안 #399926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399926 2021-05-06T23:14:45 Z GioChkhaidze Worst Reporter 3 (JOI18_worst_reporter3) C++14
7 / 100
 261 ms 5292 KB 
#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
#define f first
#define s second
 
using namespace std;
 
const int N = 5e5 + 5;
 
int n, q, d[N];
vector < pair < int , int > > v;
 
main () {
	ios::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	cin >> n >> q;
	for (int i = 1; i <= n; ++i) {
		cin >> d[i];
	}
	
	for (int i = 1; i <= n; ++i) {
		if (!v.size() || d[v.back().f] < d[i]) {
			v.pb({i, 1});
		}
			else {
			++v.back().s;		
		}
	}
	
	ll x = 1;
	for (int i = 0; i < v.size(); ++i) {
		v[i].f = x * ((d[v[i].f] - 1) / x + 1);
		x = v[i].f;
	}
	
	assert(v.size() <= 120);
	int t, l, r, sum, ans, L, R;
	for (int i = 1; i <= q; ++i) {
		cin >> t >> l >> r;
		if (t < l) {
			cout << 0 << "\n";
			continue;
		}
		
		sum = -1, ans = (l <= t && t <= r);
		for (int j = 0; j < v.size(); ++j) {
			R = t + (sum - t % v[j].f);
			L = R - v[j].s + 1;	
			if (R < l) break;
			if (R > r) R = r;
			if (L < l) L = l;
			if (L <= R) ans += R - L + 1;
			sum -= v[j].s;
		}
		
		cout << ans << "\n";
	}
}

Compilation message

worst_reporter3.cpp:15:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   15 | main () {
      |       ^
worst_reporter3.cpp: In function 'int main()':
worst_reporter3.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 0; i < v.size(); ++i) {
      |                  ~~^~~~~~~~~~
worst_reporter3.cpp:48:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for (int j = 0; j < v.size(); ++j) {
      |                   ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 5236 KB Output is correct
2 Correct 261 ms 5220 KB Output is correct
3 Correct 253 ms 5264 KB Output is correct
4 Correct 258 ms 5292 KB Output is correct
5 Correct 258 ms 5276 KB Output is correct
6 Correct 253 ms 5276 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Runtime error 2 ms 460 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 5236 KB Output is correct
2 Correct 261 ms 5220 KB Output is correct
3 Correct 253 ms 5264 KB Output is correct
4 Correct 258 ms 5292 KB Output is correct
5 Correct 258 ms 5276 KB Output is correct
6 Correct 253 ms 5276 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Runtime error 2 ms 460 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -