oj.uz

Submission #842954

# Submission time Handle Problem Language Result Execution time Memory
842954 2023-09-03T13:50:21 Z anha3k25cvp Linear Garden (IOI08_linear_garden) C++14
75 / 100
 566 ms 65536 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 <vector <vector <int>>> f(n + 1, vector <vector <int>> (5, vector <int> (5, 0)));
    for (int mi = 0; mi <= 4; mi ++)
        for (int ma = mi; ma <= 4; ma ++) {
            vector <vector <vector <int>>> g(n + 1, vector <vector <int>> (5, vector <int> (5, 0)));
            g[0][mi][ma] = 1;
            for (int num = 0; num < n; num ++)
                for (int i = 0; i <= 4; i ++)
                    for (int j = i; j <= 4; j ++) {
                        if (i > 0) {
                            int i_ = min(i - 1, 1), j_ = max(j - 1, 1);
                            g[num + 1][i_][j_] = (g[num + 1][i_][j_] + g[num][i][j]) % m;
                        }
                        if (j < 4) {
                            int i_ = min(i + 1, 3), j_ = max(j + 1, 3);
                            g[num + 1][i_][j_] = (g[num + 1][i_][j_] + g[num][i][j]) % m;
                        }
                    }
            for (int num = 0; num <= n; num ++)
                for (int i = 0; i <= 4; i ++)
                    for (int j = i; j <= 4; j ++)
                        f[num][mi][ma] = (f[num][mi][ma] + g[num][i][j]) % m;
        }
    int mi = 2, ma = 2, ans = 1;
    for (int i = 1; i <= n; i ++) {
        if (a[i] && mi > 0) {
            int mi_ = min(mi - 1, 1), ma_ = max(ma - 1, 1);
            ans = (ans + f[n - i][mi_][ma_]) % m;
        }
        if (!a[i]) {
            mi = min(mi - 1, 1);
            ma = max(ma - 1, 1);
        }
        else {
            mi = min(mi + 1, 3);
            ma = max(ma + 1, 3);
        }
    }
    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 0 ms 344 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 1 ms 344 KB Output is correct

Subtask #6
4.0 / 4.0

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

Subtask #7
4.0 / 4.0

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

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 344 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 2 ms 344 KB Output is correct

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2328 KB Output is correct
2 Correct 27 ms 2904 KB Output is correct
3 Correct 28 ms 2916 KB Output is correct

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

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

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 51 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #22
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 51 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #23
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 48 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -