Submission #805721

# Submission time Handle Problem Language Result Execution time Memory
805721 2023-08-03T21:30:46 Z handlewastaken Linear Garden (IOI08_linear_garden) C++17
80 / 100
42 ms 4200 KB
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
    ll n, m, i, s = 1, df = 0, odf;
    cin >> n >> m;
    char ch;
    bool a, b, c, x, y, z;
    a = b = c = true;
    vector<ll> po(n / 2 + 1);
    po[0] = 1;
    for (i = 1; i <= n / 2; i++)
        po[i] = (2 * po[i - 1]) % m;
    while (n--)
    {
        cin >> ch;
        odf = df;
        if (ch == 'P')
        {
            odf--;
            df++;
            x = a;
            y = b;
            z = c;
            if (odf < -2 || odf > 2)
                continue;
            if (odf < 0)
                z = false;
            if (odf > 0)
                x = false;
            if (odf == 2 || odf == -2)
                y = false;
            if (x || z)
            {
                s += po[n / 2];
                if (y)
                    s--;
            }
            if (y)
                s += po[(n + 1) / 2];
            s %= m;
        }
        else
            df--;
        x = a;
        y = b;
        z = c;
        if (df < 0)
            c = false;
        if (df > 0)
            a = false;
        if (df == 2 || df == -2)
            b = false;
    }
    cout << ((s % m) + m) % m;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 556 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 1524 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 1884 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 2312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 27 ms 2748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 4200 KB Output isn't correct
2 Halted 0 ms 0 KB -