{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"图上有 $3$ 种边:\n\u003cp\u003e\n1. $u$ 到 $v$ 的边\n\u003cp\u003e\n2. $u$ 到 $[l, r]$中的任意点的边\n\u003cp\u003e\n\n3. $[l, r]$ 中的任意点 到 $u$ 的边\n\u003cp\u003e\n每条边都有权值,他想知道从起点 $s$ 到每个点的最短路径"}},{"title":"Input","value":{"format":"HTML","content":"输入的第一行有三个整数 $n,q,s(1\\le n,q \\le10^5,1\\le s\\le n)$ 分别表示点数、边数和起点\n\u003cp\u003e\n接下来 $q$ 行是边,每行是一个 $op$ 表示类型。\n\u003cp\u003e\n若 $op\u003d1$, 则后面是 $u, v, w (1\\le u, v\\le n, 1\\le w\\le10^9)$ , 其中 $w$ 是权值; \u003cp\u003e\n否则后面是 $u, l, r, w(1\\le u, l, r\\le n, 1\\le w\\le10^9)$ , 其中 $w$ 是权值\n\n\u003cp\u003e "}},{"title":"Output","value":{"format":"HTML","content":"在输出的第一行中,以空格分隔的 $n$ 个整数。第 $i$ 个整数应该是从起点到第 $i$ 个点所需的最短路径,如果无法到达该点,则为 $-1$。"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 5 1\n2 3 2 3 17\n2 3 2 2 16\n2 2 2 3 3\n3 3 1 1 12\n1 3 3 17\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0 28 12 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4 3 1\n3 4 1 3 12\n2 2 3 4 10\n1 2 4 16\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0 -1 -1 12 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"自已模拟去吧\n\u003cp\u003eIn the first sample testcase, Rick can purchase \u003cspan class\u003d\"tex-span\"\u003e4\u003c/span\u003eth plan once and then \u003cspan class\u003d\"tex-span\"\u003e2\u003c/span\u003end plan in order to get to get to planet number \u003cspan class\u003d\"tex-span\"\u003e2\u003c/span\u003e.\u003c/p\u003e"}}]}