oj.uz

Submission #679604

# Submission time Handle Problem Language Result Execution time Memory
679604 2023-01-08T16:04:16 Z peijar Nautilus (BOI19_nautilus) C++17
100 / 100
 181 ms 416 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

namespace std {
template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) {
  out << "[";
  for (int i = 0; i < (int)vec.size(); ++i) {
    out << vec[i];
    if (i + 1 < (int)vec.size())
      out << ", ";
  }
  return out << "]";
}
} // namespace std

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << H;
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

const int MAXN = 500;

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbLig, nbCol, nbOp;
  cin >> nbLig >> nbCol >> nbOp;

  vector<bitset<MAXN>> canUse(nbLig);
  for (int lig = 0; lig < nbLig; ++lig)
    for (int col = 0; col < nbCol; ++col) {
      char c;
      cin >> c;
      if (c == '.')
        canUse[lig][col] = 1;
    }

  vector<bitset<MAXN>> curPossible(nbLig);
  for (int lig = 0; lig < nbLig; ++lig)
    curPossible[lig] = canUse[lig];

  string s;
  cin >> s;
  for (char c : s) {
    vector<bitset<MAXN>> nxtPossible(nbLig);
    if (c == 'N' or c == '?') {
      for (int lig = 0; lig + 1 < nbLig; ++lig)
        nxtPossible[lig] |= curPossible[lig + 1];
    }
    if (c == 'S' or c == '?') {
      for (int lig = 1; lig < nbLig; ++lig)
        nxtPossible[lig] |= curPossible[lig - 1];
    }
    if (c == 'W' or c == '?') {
      for (int lig = 0; lig < nbLig; ++lig)
        nxtPossible[lig] |= curPossible[lig] >> 1;
    }
    if (c == 'E' or c == '?') {
      for (int lig = 0; lig < nbLig; ++lig)
        nxtPossible[lig] |= curPossible[lig] << 1;
    }
    for (int lig = 0; lig < nbLig; ++lig)
      curPossible[lig] = nxtPossible[lig] & canUse[lig];
  }
  int sol = 0;
  for (int lig = 0; lig < nbLig; ++lig)
    sol += curPossible[lig].count();
  cout << sol << endl;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 106 ms 340 KB Output is correct
23 Correct 100 ms 340 KB Output is correct
24 Correct 100 ms 340 KB Output is correct
25 Correct 105 ms 404 KB Output is correct
26 Correct 96 ms 416 KB Output is correct
27 Correct 146 ms 340 KB Output is correct
28 Correct 140 ms 340 KB Output is correct
29 Correct 135 ms 408 KB Output is correct
30 Correct 137 ms 400 KB Output is correct
31 Correct 133 ms 340 KB Output is correct
32 Correct 168 ms 400 KB Output is correct
33 Correct 160 ms 412 KB Output is correct
34 Correct 168 ms 412 KB Output is correct
35 Correct 181 ms 408 KB Output is correct
36 Correct 162 ms 404 KB Output is correct