Submission #1033032

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033032		RecursiveCo	Trains (BOI24_trains)	C++17	100 / 100	355 ms	83540 KiB

Main

// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

int mod = 1e9 + 7;

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        get(n);
        vector<vector<int>> sum(320, vector<int>(320, 0));
        vector<int> dp(n, 0);
        vector<vector<int>> indices(n);
        vector<vector<array<int, 3>>> remsmall(n);
        dp[0] = 1;
        forto(n, i) {
            get(d);
            get(x);
            for (int ind: indices[i]) dp[i] = (dp[i] + dp[ind]) % mod;
            forto(320, j) {
                if (j == 0) continue;
                dp[i] = (dp[i] + sum[j][i % j]) % mod;
            }
            if (d >= 320) {
                for (int j = i + d; j <= min(i + x * d, n - 1); j += d) indices[j].push_back(i);
            } else if (d) {
                sum[d][i % d] = (sum[d][i % d] + dp[i]) % mod;
                if (i + x * d < n) remsmall[i + x * d].push_back({d, i % d, i});
            }
            for (auto ins: remsmall[i]) {
                int D = ins[0];
                int M = ins[1];
                int I = ins[2];
                sum[D][M] = (sum[D][M] - dp[I] + mod) % mod;
            } 
        }
        int ans = 0;
        forto(n, i) ans = (ans + dp[i]) % mod;
        out(ans);
    //}
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:78:9: note: in expansion of macro 'get'
   78 |         get(n);
      |         ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:84:9: note: in expansion of macro 'forto'
   84 |         forto(n, i) {
      |         ^~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'd' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:85:13: note: in expansion of macro 'get'
   85 |             get(d);
      |             ^~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:86:13: note: in expansion of macro 'get'
   86 |             get(x);
      |             ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:88:13: note: in expansion of macro 'forto'
   88 |             forto(320, j) {
      |             ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:106:9: note: in expansion of macro 'forto'
  106 |         forto(n, i) ans = (ans + dp[i]) % mod;
      |         ^~~~~

• Subtask 1: 8 / 8
• Subtask 2: 13 / 13
• Subtask 3: 16 / 16
• Subtask 4: 34 / 34
• Subtask 5: 29 / 29