제출 #1048331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048331		whatthemomooofun1729	Linear Garden (IOI08_linear_garden)	C++17	95 / 100	1531 ms	13304 KiB

linear_garden

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr long double EPS = (ld)1e-12, PI = 3.1415926535;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

int M;

ll ad(ll x, ll y) {
    return (x + y + M)%M;
}

int N;
string s;
vi psum, a, b;
ll ndp[9][9][9], dp[9][9][9], pd[9][9];
ll ans = 0;

int weight(int i) {
    return (s[i] == 'L' ? 1 : -1);
}

void update_pd() {
    for (int c = -4; c <= 4; ++c) {
        for (int d = c; d <= 4; ++d) {
            for (int j = c; j <= d; ++j) {
                pd[c + 4][d + 4] = ad(pd[c + 4][d + 4], dp[c + 4][d + 4][j + 4]);
            }
        }
    }
}

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> M;
    cin >> s;
    psum.rsz(N, 0), a.rsz(N, INF), b.rsz(N, 0);
    for (int i = 0; i < N; ++i) {
        psum[i] = (i > 0 ? psum[i-1] : 0) + weight(i);
        a[i] = b[i] = psum[i];
        if (i) {
            ckmin(a[i], a[i-1]);
            ckmax(b[i], b[i+1]);
        }
    }
    dp[4][4][4] = 1;
    update_pd();
    for (int i = N-1; i >= 0; --i) {
        // add to the answer
        if (s[i] == 'P') {
            int np = (i > 0 ? psum[i-1] : 0) + 1;
            int A = (i > 0 ? a[i-1] : INF), B = (i > 0 ? b[i-1] : 0);
            ckmin(A, np);
            ckmax(B, np);
            for (int c = -4; c <= 4; ++c) {
                for (int d = c; d <= 4; ++d) {
                    if (np + c <= 2 && np + c >= -2 && np + d <= 2 && np + d >= -2 && max({np + c, np + d, A, B}) - min({np + c, np + d, A, B}) <= 2) {
                        //if (abs(d - c) > 2 || abs(A - B) > 2 || abs(np) > 2) continue;
                        //debug(pd[c + 4][d + 4]);
                        ans = ad(ans, pd[c + 4][d + 4]);
                    }
                }
            }
        }
        // reset values to 0
        memset(ndp, 0, sizeof(ndp));
        memset(pd, 0, sizeof(pd));
        // update the new DP values
        for (int c = -4; c <= 4; ++c) {
            for (int d = c; d <= 4; ++d) {
                for (int j = c; j <= d; ++j) {
                    for (int k = 0; k < 2; ++k) {

                        int w = (k == 0 ? -1 : 1);
                        int j_ = w + j;
                        int c_ = min(c, j_);
                        int d_ = max(d, j_);
                        if (abs(j_) > 4 || abs(c_) > 4 || abs(d_) > 4) continue;
                        ndp[c_ + 4][d_ + 4][j_ + 4] = ad(ndp[c_ + 4][d_ + 4][j_ + 4], dp[c + 4][d + 4][j + 4]);
                    }
                }
            }
        }
        swap(ndp, dp);
        update_pd();
    }
    ans = ad(ans, 1);
    cout << ans;
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

컴파일 시 표준 에러 (stderr) 메시지

linear_garden.cpp: In function 'void setIO(const string&)':
linear_garden.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
linear_garden.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 4 / 4
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 0 / 5