oj.uz

Submission #782518

# Submission time Handle Problem Language Result Execution time Memory
782518 2023-07-14T04:07:09 Z phoebe Linear Garden (IOI08_linear_garden) C++17
85 / 100
 59 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
#define PB push_back
#define ALL(x) x.begin(), x.end()
#define FOR(i, n) for (int i = 0; i < n; i++)
#define NYOOM ios::sync_with_stdio(0); cin.tie(0);
#define endl '\n'
const int INF = 1e9 + 7;
const ll LLINF = 1ll<<60;

const int maxn = 1e6 + 10;
int n, m, dp[3][3][maxn];
string s; 

int cnt(int mn, int mx, int rem){ // mn = min(l - p), mx = max(l - p)
    if (mn <= -3 || mx >= 3) return 0;
    if (rem <= 0) return 1;
    if (dp[-mn][mx][rem] != -1) return dp[-mn][mx][rem];
    int go_l = cnt(min(mn + 1, 0), mx + 1, rem - 1);
    int go_p = cnt(mn - 1, max(0, mx - 1), rem - 1);
    dp[-mn][mx][rem] = (go_l + go_p) % m;
    return dp[-mn][mx][rem];
}

signed main(){
    NYOOM;
    fill(&dp[0][0][0], &dp[0][0][0] + 3 * 3 * maxn, -1);
    cin >> n >> m;
    cin >> s;
    int re = 1, mn = 0, mx = 0;
    FOR(i, n){
        if (s[i] == 'L'){
            mn = min(0, mn + 1), mx = mx + 1;
            continue;
        }
        // cur is p
        int rem = n - i - 1;
        int go_l = cnt(min(mn + 1, 0), mx + 1, rem);
        mn = mn - 1, mx = max(0, mx - 1);
        re = (re + go_l) % m;
    }
    cout << re;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
2.0 / 2.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
4.0 / 4.0

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

Subtask #7
4.0 / 4.0

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

Subtask #8
4.0 / 4.0

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

Subtask #9
4.0 / 4.0

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

Subtask #10
4.0 / 4.0

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

Subtask #11
4.0 / 4.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35544 KB Output is correct
2 Correct 15 ms 35540 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 35532 KB Output is correct
2 Correct 18 ms 35516 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 35704 KB Output is correct
2 Correct 15 ms 35712 KB Output is correct
3 Correct 16 ms 35548 KB Output is correct

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

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

Subtask #19
5.0 / 5.0

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

Subtask #20
5.0 / 5.0

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

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 31 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 30 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 37 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -