結果
| 問題 | No.971 いたずらっ子 |
| ユーザー |
 hitonanode
|
| 提出日時 | 2020-01-17 21:33:09 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,373 bytes |
| コンパイル時間 | 1,875 ms |
| コンパイル使用メモリ | 184,432 KB |
| 実行使用メモリ | 147,092 KB |
| 最終ジャッジ日時 | 2024-06-25 18:50:55 |
| 合計ジャッジ時間 | 8,609 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/
struct DirectedGraph
{
using Pint = pair<int, int>;
using Plint = pair<lint, int>;
int V;
int E;
int dDefault;
vector<lint> weights;
vector<vector<Pint>> to;
vector<Pint> edges;
DirectedGraph(int V, lint dDefault = -1) : V(V), E(0), dDefault(dDefault),
to(vector<vector<Pint>>(V)) {}
void add_edge(int v1, int v2, lint w)
{
to[v1].push_back(Pint(v2, E));
edges.push_back(Pint(v1, v2));
weights.push_back(w);
E++;
}
vector<lint> dist;
void dijkstra(int start)
{
dist = vector<lint>(V, dDefault);
priority_queue<Plint, vector<Plint>, greater<Plint>> pq;
pq.push(Plint(0, start));
while (!pq.empty()) {
Plint p = pq.top(); pq.pop();
int v = p.second;
if (dist[v] >= 0 && dist[v] < p.first) continue;
dist[v] = p.first;
for (auto vnxt : to[v]) {
lint dnxt = dist[v] + weights[vnxt.second];
if (dnxt < dist[vnxt.first] || dist[vnxt.first] < 0) {
dist[vnxt.first] = dnxt;
pq.push(Plint(dnxt, vnxt.first));
}
}
}
}
};
int main()
{
int H, W;
cin >> H >> W;
vector<string> A(H);
cin >> A;
DirectedGraph g(H * W);
vector<int> dx{W, -W, 1, -1};
vector<lint> D(H * W, 1e18);
D[0] = 0;
queue<int> nxt;
nxt.push(0);
while (!nxt.empty()) {
int now = nxt.front();
nxt.pop();
for (auto v : dx) {
int to = now + v;
if (to < 0 or to >= D.size()) continue;
int x = to / W, y = to % W;
int dd = 1 + (A[x][y] == 'k') * (x + y);
if (mmin(D[to], D[now] + dd)) nxt.push(to);
}
}
cout << D.back() << endl;
}