oj.uz

Submission #842999

# Submission time Handle Problem Language Result Execution time Memory
842999 2023-09-03T14:25:55 Z anha3k25cvp Linear Garden (IOI08_linear_garden) C++14
100 / 100
 1158 ms 18444 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const int inf = 7 + 1e9;

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n, m;
    string s;
    cin >> n >> m >> s;
    n = s.size();
    vector <int> a(n + 1, 0);
    for (int i = 1; i <= n; i ++)
        a[i] = s[i - 1] == 'P';
    vector <II> b(n + 1, {-1, -1});
    int x = 2, y = 2;
    for (int i = 1; i <= n; i ++) {
        if (a[i] && x > 0) {
            int mi_ = min(x - 1, 1), ma_ = max(y - 1, 1);
            b[n - i] = {mi_, ma_ - mi_};
        }
        if (!a[i]) {
            x = min(x - 1, 1);
            y = max(y - 1, 1);
        }
        else {
            x = min(x + 1, 3);
            y = max(y + 1, 3);
        }
    }
    vector <int> f(n + 1, 0);
    vector <vector <vector <vector <vector <int>>>>> g(2, vector <vector <vector <vector <int>>>> (5, vector <vector <vector <int>>> (3, vector <vector <int>> (5, vector <int> (3, 0)))));
    for (int mi = 0; mi <= 4; mi ++)
        for (int ma = mi; ma <= min(mi + 2, 4); ma ++)
            g[1][mi][ma - mi][mi][ma - mi] = 1;
    for (int num = 0; num <= n; num ++)
        for (int mi = 0; mi <= 4; mi ++)
            for (int ma = 0; ma <= min(4 - mi, 2); ma ++) {
                for (int i = 0; i <= 4; i ++)
                    for (int delta = 0; delta <= min(4 - i, 2); delta ++) {
                        g[0][mi][ma][i][delta] = g[1][mi][ma][i][delta];
                        g[1][mi][ma][i][delta] = 0;
                        if (b[num].st == mi && b[num].nd == ma)
                            f[num] = (f[num] + g[0][mi][ma][i][delta]) % m;
                    }
                if (num == n)
                    break;
                for (int i = 0; i <= 4; i ++)
                    for (int delta = 0; delta <= min(4 - i, 2); delta ++) {
                        int j = i + delta;
                        if (i > 0) {
                            int i_ = min(i - 1, 1), j_ = max(j - 1, 1);
                            g[1][mi][ma][i_][j_ - i_] = (g[1][mi][ma][i_][j_ - i_] + g[0][mi][ma][i][delta]) % m;
                        }
                        if (j < 4) {
                            int i_ = min(i + 1, 3), j_ = max(j + 1, 3);
                            g[1][mi][ma][i_][j_ - i_] = (g[1][mi][ma][i_][j_ - i_] + g[0][mi][ma][i][delta]) % m;
                        }
                    }
            }
    int ans = 1;
    for (int i = 0; i <= n; i ++)
        ans = (ans + f[i]) % m;
    cout << ans;
    return 0;
}

Compilation message

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #9
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #10
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 540 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 680 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1016 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1536 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1784 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 6048 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 7664 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 9576 KB Output is correct

Subtask #22
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 717 ms 11556 KB Output is correct

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1153 ms 18188 KB Output is correct
2 Correct 1142 ms 18444 KB Output is correct
3 Correct 1158 ms 18188 KB Output is correct