leetcode/127.cpp at main · h3902340/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include "Jutil.h"
using namespace std;

#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"

struct Data {
    int i;
    int c;
};
const int N = 5000;
Data q[N];
bool vis[N];
class Solution {
   public:
    int ladderLength(string beginWord, string endWord,
                     vector<string>& wordList) {
        int n = wordList.size();
        int m = beginWord.size();
        unordered_map<string, vector<int>> se;
        for (int i = 0; i < n; i++) {
            vis[i] = false;
            for (int j = 0; j < m; j++) {
                string t = wordList[i];
                t[j] = 0;
                se[t].push_back(i);
            }
        }
        wordList.push_back(beginWord);
        int l = 0;
        int r = 0;
        q[r++] = {n, 1};
        while (l < r) {
            Data a = q[l++];
            if (wordList[a.i] == endWord) {
                return a.c;
            }
            for (int j = 0; j < m; j++) {
                string t = wordList[a.i];
                t[j] = 0;
                if (se.count(t)) {
                    for (auto e : se[t]) {
                        if (vis[e]) {
                            continue;
                        }
                        q[r++] = {e, a.c + 1};
                        vis[e] = true;
                    }
                }
            }
        }
        return 0;
    }
};

int main() {
    string problemName = "127";
    auto begin = jtimer();
    Solution sol;
    ifstream file_in("testcases/" + problemName + "_in.txt");
    ifstream file_out("testcases/" + problemName + "_out.txt");
    bool allPass = true;
    int caseCount = 0;
    int passCount = 0;
    string line_in;
    string line_out;
    while (getline(file_in, line_in)) {
        auto beginWord = jread_string(line_in);
        getline(file_in, line_in);
        auto endWord = jread_string(line_in);
        getline(file_in, line_in);
        auto wordList = jread_vector_string(line_in);
        auto res = sol.ladderLength(beginWord, endWord, wordList);
        getline(file_out, line_out);
        auto ans = jread_int(line_out);
        printf("Case %d", ++caseCount);
        if (res == ans) {
            passCount++;
            printf(" %s(PASS)", KGRN);
        } else {
            printf(" %s(WRONG)", KRED);
            allPass = false;
        }
        printf("\n%s", KNRM);
        jprint(res, "res");
        jprint(ans, "ans");
        printf("\n");
    }
    if (allPass) {
        printf("%sALL CORRECT [%d/%d]\n%s", KGRN, passCount, caseCount, KNRM);
    } else {
        printf("%sWRONG ANSWER [%d/%d]\n%s", KRED, passCount, caseCount, KNRM);
    }
    auto end = jtimer();
    jprint_time(begin, end);
    return 0;
}