oj.uz

Submission #974541

# Submission time Handle Problem Language Result Execution time Memory
974541 2024-05-03T12:38:09 Z Mher777 Nautilus (BOI19_nautilus) C++17
100 / 100
 189 ms 1368 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 505, M = 5005;
char a[N][N], s[M];
bitset<N* N> dp, pos;
int r, c, n;

bool check(int i, int j) {
    if (i >= 1 && i <= r && j >= 1 && j <= c && a[i][j] == '.') return true;
    return false;
}

void slv() {
    cin >> r >> c >> n;
    set<pii> st;
    int cnt = 0;
    for (int i = 1; i <= r; ++i) {
        for (int j = 1; j <= c; ++j) {
            cin >> a[i][j];
            ++cnt;
            if (a[i][j] == '.') {
                dp[cnt] = pos[cnt] = 1;
            }
        }
        ++cnt;
    }
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
        if (s[i] == 'W') s[i] = 'L';
        else if (s[i] == 'E') s[i] = 'R';
        else if (s[i] == 'N') s[i] = 'U';
        else if (s[i] == 'S') s[i] = 'D';
        if (s[i] == 'L') {
            dp = ((dp >> 1) & pos);
        }
        else if (s[i] == 'R') {
            dp = ((dp << 1) & pos);
        }
        else if (s[i] == 'U') {
            dp = ((dp >> (c + 1)) & pos);
        }
        else if (s[i] == 'D') {
            dp = ((dp << (c + 1)) & pos);
        }
        else {
            dp = (((dp >> 1) & pos) | ((dp << 1) & pos) | ((dp >> (c + 1)) & pos) | ((dp << (c + 1)) & pos));
        }
    }
    cout << dp.count();
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

nautilus.cpp: In function 'll range_sum(ll, ll)':
nautilus.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
nautilus.cpp: In function 'll bin_to_dec(std::string)':
nautilus.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 700 KB Output is correct
6 Correct 1 ms 820 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 700 KB Output is correct
6 Correct 1 ms 820 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 2 ms 812 KB Output is correct
9 Correct 3 ms 900 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 820 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 1108 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 4 ms 860 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 2 ms 700 KB Output is correct
6 Correct 1 ms 820 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 2 ms 812 KB Output is correct
9 Correct 3 ms 900 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 820 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 1108 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 86 ms 1116 KB Output is correct
23 Correct 85 ms 1116 KB Output is correct
24 Correct 84 ms 1116 KB Output is correct
25 Correct 84 ms 1348 KB Output is correct
26 Correct 79 ms 1112 KB Output is correct
27 Correct 141 ms 1112 KB Output is correct
28 Correct 141 ms 1344 KB Output is correct
29 Correct 142 ms 1368 KB Output is correct
30 Correct 143 ms 1116 KB Output is correct
31 Correct 147 ms 1324 KB Output is correct
32 Correct 184 ms 1344 KB Output is correct
33 Correct 187 ms 1116 KB Output is correct
34 Correct 189 ms 1360 KB Output is correct
35 Correct 186 ms 1344 KB Output is correct
36 Correct 185 ms 1116 KB Output is correct