oj.uz

답안 #158166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
158166 2019-10-15T07:10:16 Z fedoseevtimofey Worst Reporter 3 (JOI18_worst_reporter3) C++14
7 / 100
 307 ms 7544 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define int long long

const int K = 50;
int L[K], R[K];
const int N = 5e5 + 7;
int _time[N];

const ll Inf = 1e9 + 7;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    int n, q;
    cin >> n >> q;
    vector <int> d(n + 1);
    for (int i = 1; i <= n; ++i) cin >> d[i];   
    d[0] = 1;
    ++n;
    int m;
    {
        vector <pair <int, int>> seg;
        int lst = 0;
        for (int i = 1; i < n; ++i) {
            if (d[i] > d[lst]) {  
                seg.push_back({lst, i - 1});
                lst = i;
            }
        }
        seg.push_back({lst, n - 1});
        for (int i = 0; i < min(K, (int)seg.size()); ++i) {
            L[i] = seg[i].first;
            R[i] = seg[i].second;
        }
        m = min(K, (int)seg.size());
        _time[0] = 1;
        for (int i = 1; i < min(K, (int)seg.size()); ++i) {
            int a = L[i - 1];
            int b = L[i];
            ll t = (ll)_time[i - 1] * (d[b] + d[a] - 1) / d[a];
            t = min(t, Inf);
            _time[i] = t;
        }
    }
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        int ans = 0;
        for (int i = 0; i < m; ++i) {
            int cnt = t / _time[i];
            ll pl = -L[i], pr = -R[i];
            pl += (ll)cnt * d[L[i]];
            pr += (ll)cnt * d[L[i]];
            swap(pl, pr);
            pl = max(pl, (ll)l);
            pr = min(pr, (ll)r);
            ans += max(0LL, pr - pl + 1);
        }
        cout << ans << '\n';
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 7420 KB Output is correct
2 Correct 297 ms 7352 KB Output is correct
3 Correct 299 ms 7480 KB Output is correct
4 Correct 307 ms 7416 KB Output is correct
5 Correct 300 ms 7544 KB Output is correct
6 Correct 298 ms 7416 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 3 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 7420 KB Output is correct
2 Correct 297 ms 7352 KB Output is correct
3 Correct 299 ms 7480 KB Output is correct
4 Correct 307 ms 7416 KB Output is correct
5 Correct 300 ms 7544 KB Output is correct
6 Correct 298 ms 7416 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Incorrect 3 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -