oj.uz

Submission #1010566

# Submission time Handle Problem Language Result Execution time Memory
1010566 2024-06-29T08:08:05 Z Beerus13 Trains (BOI24_trains) C++14
100 / 100
 214 ms 130648 KB 
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, a, b)  for(int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a) for(int i = (b), _a = (a); i >= _a; --i)
#define REP(i, a, b)  for(int i = (a), _b = (b); i < _b;  ++i)
#define REPD(i, b, a) for(int i = (b), _a = (a); i > _a;  --i)
#define MASK(i) (1LL << (i))
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define __builtin_popcount __builtin_popcountll
#define all(val) val.begin(), val.end()
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll Rand(ll l, ll r) {return l + rng() % (r - l + 1);}

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } else return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } else return false;
    }
template<class T>
    T Abs(const T &x) {
        return (x < 0 ? -x : x);
    }

const int N = 1e5 + 5;
const int sqr = 320;
const int mod = 1e9 + 7;

void add(int &a, const int &b) {
    a += b;
    if(a >= mod) a -= mod;
    if(a < 0) a += mod;
}

int mul(const int &a, const int &b) {
    return 1ll * a * b % mod;
}

int n, d[N], x[N];
int dp[N], f[N][sqr + 5];

int check1, check2;

void sub2() {
    if(n > 1e4) return;
    dp[1] = 1;
    int res = 0;
    FOR(i, 1, n) if(x[i] && d[i]) {
        FOR(j, 1, x[i]) {
            if(i + j * d[i] > n) break;
            add(dp[i + j * d[i]], dp[i]);
        }
    }
    FOR(i, 1, n) add(res, dp[i]);
    check1 = res;
    cout << res << '\n';
    exit(0);
}

void sub5() {
    dp[1] = 1;
    int res = 0;
    FOR(i, 1, n) {
        FOR(k, 1, sqr) {
            if(i >= k) add(f[i][k], f[i - k][k]);
            add(dp[i], f[i][k]);
        }

        if(d[i] == 0 || x[i] == 0) continue;

        if(d[i] > sqr) {
            FOR(j, 1, x[i]) {
                if(i + j * d[i] > n) break;
                add(dp[i + j * d[i]], dp[i]);
            }
        }
        else {
            add(f[i][d[i]], dp[i]);
            ll mx = 1ll * d[i] * (x[i] + 1);
            if(i + mx <= n) add(f[i + mx][d[i]], -dp[i]);
        }
    }
    FOR(i, 1, n) add(res, dp[i]);
    check2 = res;
    cout << res << '\n';
    exit(0);
}

void sinhtest() {
    int ntests = 10;
    while(ntests--) {
        n = Rand(1, 1e3);
        FOR(i, 1, n) {
            d[i] = Rand(0, 1e9);
            x[i] = Rand(0, 1e9);
        }
        memset(dp, 0, sizeof(dp));
        FOR(i, 1, n) memset(f[i], 0, sizeof(f[i]));
        sub2();
        memset(dp, 0, sizeof(dp));
        sub5();
        if(check1 == check2) cout << "CORRECT\n";
        else {
            cout << "INCORRECT\n";
            cout << n << '\n';
            FOR(i, 1, n) cout << d[i] << ' ' << x[i] << '\n';
            return;
        }
    }
}

void process() {
    cin >> n;
    FOR(i, 1, n) cin >> d[i] >> x[i];
    sub2();
    sub5();
}

signed main() {
    if(fopen("test.inp","r")) {
        freopen("test.inp","r",stdin);
        freopen("test.out","w",stdout);
    }
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int ntests = 1;
    // cin >> ntests;
    while(ntests--) process();
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:136:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |         freopen("test.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |         freopen("test.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 9 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 23 ms 344 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 5 ms 584 KB Output is correct
26 Correct 9 ms 348 KB Output is correct
27 Correct 37 ms 348 KB Output is correct
28 Correct 7 ms 600 KB Output is correct
29 Correct 43 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 20 ms 348 KB Output is correct
32 Correct 37 ms 604 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 600 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 25 ms 348 KB Output is correct
3 Correct 12 ms 532 KB Output is correct
4 Correct 30 ms 348 KB Output is correct
5 Correct 100 ms 99668 KB Output is correct
6 Correct 129 ms 128592 KB Output is correct
7 Correct 127 ms 128596 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 42 ms 604 KB Output is correct
12 Correct 129 ms 128596 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 41 ms 348 KB Output is correct
15 Correct 123 ms 128708 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 62040 KB Output is correct
2 Correct 57 ms 52308 KB Output is correct
3 Correct 133 ms 129876 KB Output is correct
4 Correct 105 ms 93264 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 45 ms 732 KB Output is correct
8 Correct 137 ms 129876 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 9 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 23 ms 344 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 5 ms 584 KB Output is correct
26 Correct 9 ms 348 KB Output is correct
27 Correct 37 ms 348 KB Output is correct
28 Correct 7 ms 600 KB Output is correct
29 Correct 43 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 20 ms 348 KB Output is correct
32 Correct 37 ms 604 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 600 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 25 ms 348 KB Output is correct
39 Correct 12 ms 532 KB Output is correct
40 Correct 30 ms 348 KB Output is correct
41 Correct 100 ms 99668 KB Output is correct
42 Correct 129 ms 128592 KB Output is correct
43 Correct 127 ms 128596 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 42 ms 604 KB Output is correct
48 Correct 129 ms 128596 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 41 ms 348 KB Output is correct
51 Correct 123 ms 128708 KB Output is correct
52 Correct 77 ms 62040 KB Output is correct
53 Correct 57 ms 52308 KB Output is correct
54 Correct 133 ms 129876 KB Output is correct
55 Correct 105 ms 93264 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 45 ms 732 KB Output is correct
59 Correct 137 ms 129876 KB Output is correct
60 Correct 121 ms 108196 KB Output is correct
61 Correct 170 ms 129616 KB Output is correct
62 Correct 132 ms 129364 KB Output is correct
63 Correct 132 ms 129616 KB Output is correct
64 Correct 163 ms 130648 KB Output is correct
65 Correct 197 ms 130132 KB Output is correct
66 Correct 139 ms 129876 KB Output is correct
67 Correct 134 ms 130128 KB Output is correct
68 Correct 138 ms 129876 KB Output is correct
69 Correct 214 ms 129360 KB Output is correct
70 Correct 133 ms 129792 KB Output is correct
71 Correct 169 ms 129728 KB Output is correct
72 Correct 212 ms 129620 KB Output is correct