oj.uz

Submission #158169

# Submission time Handle Problem Language Result Execution time Memory
158169 2019-10-15T07:30:53 Z fedoseevtimofey Worst Reporter 3 (JOI18_worst_reporter3) C++14
12 / 100
 473 ms 13180 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 1007;
const int T = 1007;

int pos[T][N];

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;
    for (int i = 0; i < n; ++i) pos[0][i] = -i;
    for (int t = 1; t < T; ++t) {
        for (int i = 0; i < n; ++i) {
            pos[t][i] = pos[t - 1][i];
        }
        ++pos[t][0];
        for (int i = 1; i < n; ++i) {
            if (pos[t][i - 1] - pos[t][i] > d[i]) {
                pos[t][i] = pos[t][i - 1] - 1;
            }
        }
    }
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        int ans = 0;
        for (int i = 0; i < n; ++i) if (l <= pos[t][i] && pos[t][i] <= r) ++ans;
        cout << ans << '\n';
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 473 ms 13180 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4344 KB Output is correct
2 Correct 9 ms 4344 KB Output is correct
3 Correct 9 ms 4344 KB Output is correct
4 Correct 8 ms 4344 KB Output is correct
5 Correct 9 ms 4348 KB Output is correct
6 Correct 9 ms 4304 KB Output is correct

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Runtime error 473 ms 13180 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -