oj.uz

Submission #372259

# Submission time Handle Problem Language Result Execution time Memory
372259 2021-02-27T11:12:39 Z gustason Travels (LMIO17_keliones) C++11
8 / 100
 35 ms 5740 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct SegmentTree {
    vector<ll> tree;
    int n;
    SegmentTree(vector<int>& a) {
        n = a.size();
        tree.assign(2*n, 0);

        for(int i = n; i < 2*n; i++) {
            tree[i] = a[i-n];
        }
        for(int idx = n-1; idx > 0; idx--) {
            tree[idx] = tree[2*idx] + tree[2*idx+1];
        }
    }
    void update(int idx, ll val) {
        idx += n;
        tree[idx] = val;

        while(idx > 1) {
            idx /= 2;
            tree[idx] = tree[2*idx] + tree[2*idx+1];
            tree[idx] %= mod;
        }
    }
    ll getSum(int L, int R) {
        L += n;
        R += n;
        ll sum = 0;

        while(L < R) {
            if (L % 2) {
                sum += tree[L];
                sum %= mod;
                L++;
            }
            if (R % 2) {
                R--;
                sum += tree[R];
                sum %= mod;
            }
            L /= 2, R /= 2;
        }

        return sum;
    }
};
const int maxN = 200005;
vector<int> adj[maxN];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("test.in", "r", stdin);
    int n, m;
    cin >> n >> m;
    vector<ll> add(n+1);
    for(int i = 0; i < n; i++) {
        cin >> add[i];
    }

    vector<ll> pref(n+1, 0);
    pref[0] = 0;
    for(int i = 1; i <= n; i++) {
        pref[i] = pref[i-1];
        pref[i] += add[i-1];
    }
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        adj[b].push_back(a);
    }

    vector<int> a(n+1, 0);
    SegmentTree cnt(a), sum(a);
    for(int i = 0; i < n; i++) {
        cnt.update(i, cnt.getSum(0, i) + i);
        sum.update(i, sum.getSum(i, i+1) + sum.getSum(0, i) + pref[i]);
        for(int j : adj[i]) {
            cnt.update(i, cnt.getSum(i, i+1) - cnt.getSum(j, j+1) - 1);
            sum.update(i, sum.getSum(i, i+1) - add[j] - sum.getSum(j, j+1));
        }
        sum.update(i, sum.getSum(i, i+1) + (add[i] * cnt.getSum(i, i+1)) % mod);
    }
    cout << sum.getSum(0, n);
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 5 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 5032 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 4 ms 4972 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 5 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 5032 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 4 ms 4972 KB Output is correct
13 Correct 35 ms 5652 KB Output is correct
14 Correct 31 ms 5740 KB Output is correct
15 Incorrect 33 ms 5612 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5652 KB Output is correct
2 Correct 31 ms 5740 KB Output is correct
3 Incorrect 33 ms 5612 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5652 KB Output is correct
2 Correct 31 ms 5740 KB Output is correct
3 Incorrect 33 ms 5612 KB Output isn't correct
4 Halted 0 ms 0 KB -