oj.uz

답안 #210824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210824 2020-03-18T18:29:51 Z bash Worst Reporter 3 (JOI18_worst_reporter3) C++17
19 / 100
 1569 ms 22896 KB 
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}

int A[MAXN];
int D[MAXN];
int n, q;

int val(int T, int pos) {
	int per = T / A[pos];
	return per * A[pos] - pos;	
}

int solve(int T, int x) {
	/// A[i - 1] > A[i]
	/// find max i that a[i] <= x
	int l = 1, r = n;
	int ans = n + 1;
	while(l <= r) {
		int mid = (l + r) / 2;
		if (val(T, mid) <= x) {
			ans = mid;
			r = mid - 1;			
		} else {
			l = mid + 1;
		}
	}
	return n - ans + 1;	
}

int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    n = readInt(), q = readInt();
    for (int i = 1; i <= n; i++) {
    	D[i] = readInt();
    }
    A[1] = D[1];
    for (int i = 2; i <= n; i++) {
    	A[i] = A[i - 1] * ((D[i] + A[i - 1] - 1)  / A[i - 1]);
    }
	while(q--) {
		int T = readInt(), L = readInt(), R = readInt();
		cout << solve(T, R) - solve(T, L - 1) + (L <= T && T <= R) << endl;
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1569 ms 22704 KB Output is correct
2 Correct 1144 ms 22772 KB Output is correct
3 Correct 1109 ms 22896 KB Output is correct
4 Correct 985 ms 22860 KB Output is correct
5 Correct 828 ms 22864 KB Output is correct
6 Correct 931 ms 22784 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 7 ms 276 KB Output is correct
4 Correct 8 ms 276 KB Output is correct
5 Correct 7 ms 380 KB Output is correct
6 Correct 7 ms 376 KB Output is correct

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1569 ms 22704 KB Output is correct
2 Correct 1144 ms 22772 KB Output is correct
3 Correct 1109 ms 22896 KB Output is correct
4 Correct 985 ms 22860 KB Output is correct
5 Correct 828 ms 22864 KB Output is correct
6 Correct 931 ms 22784 KB Output is correct
7 Correct 8 ms 380 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 7 ms 276 KB Output is correct
10 Correct 8 ms 276 KB Output is correct
11 Correct 7 ms 380 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Runtime error 112 ms 9580 KB Execution killed with signal 8 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -