oj.uz

Submission #1007934

# Submission time Handle Problem Language Result Execution time Memory
1007934 2024-06-26T00:39:48 Z whatthemomooofun1729 Board (CEOI13_board) C++17
40 / 100
 3 ms 2320 KB 
#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 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 L1, L2;
string a, b;
ll arr[100005], brr[100005];

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> a >> b;
    arr[0] = 1, brr[0] = 1;
    L1 = L2 = 1;
    for (int i = 0; i < sz(a); ++i) {
        char c = a[i];
        if (c == '1') {
            L1++;
        } else if (c == '2') {
            arr[L1] = 1;
            L1++;
        } else if (c == 'U') {
            if (L1 > 2) {
                ll x = arr[L1 - 1], y = (x - (x & 1))/2;
                arr[L1 - 1] = 0; // doesn't exist no more
                arr[L1 - 2] += y;
            }
            L1--;
        } else if (c == 'L') {
            arr[L1 - 1]--;
        } else {
            arr[L1 - 1]++;
        }
    }
    for (int i = L1-1; i >= 0; --i) {
        ll x = arr[i], y = (x - (x & 1))/2;
        arr[i] = (abs(x)) & 1;
        arr[i-1] += y;
    }
    for (int i = 0; i < sz(b); ++i) {
        char c = b[i];
        if (c == '1') {
            L2++;
        } else if (c == '2') {
            brr[L2] = 1;
            L2++;
        } else if (c == 'U') {
            if (L2 > 2) {
                ll x = brr[L2 - 1], y = (x - (x & 1))/2;
                brr[L2 - 1] = 0; // doesn't exist no more
                brr[L2 - 2] += y;
            }
            L2--;
        } else if (c == 'L') {
            brr[L2 - 1]--;
        } else {
            brr[L2 - 1]++;
        }
    }
    for (int i = L2-1; i >= 0; --i) {
        ll x = brr[i], y = (x - (x & 1))/2;
        brr[i] = (abs(x)) & 1;
        brr[i-1] += y;
    }
//    for (int i = 0; i < L1; ++i) {
//        cerr << arr[i];
//    }
//    cerr << '\n';
//    for (int i = 0; i < L2; i++) {
//        cerr << brr[i];
//    }
    cerr << '\n';
    ll diff[100005];
    diff[0] = arr[0] - brr[0];
    ll ans = abs(diff[0]) + L1 - 1 + L2 - 1;
    for (int i = 1; i <= 100000; ++i) {
        if (i == min(L1, L2)) break;
        diff[i] = diff[i-1] * 2 + arr[i] - brr[i];
        ckmin(ans, abs(diff[i]) + abs((L1 - 1) - i) + abs((L2 - 1) - i));
        if (diff[i] > (ll)3e5) break;
    }
    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

Compilation message

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Incorrect 0 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Correct 1 ms 1276 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Incorrect 2 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2136 KB Output is correct
2 Incorrect 2 ms 2140 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2140 KB Output is correct
2 Incorrect 1 ms 2140 KB Output isn't correct
3 Halted 0 ms 0 KB -