Submission #2860746


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<int, ii> iii;

const int N = 2e5 + 10;
const int oo = 1e9;

struct state{ int dist, u, ci; };
int n, m;
map<int, int> dp[N];
vector<ii> vi[N];

void solve()    {
    deque<state> pq;
    pq.push_back({0, 1, 0});

    while(!pq.empty())  {
        state cur = pq.front(); pq.pop_front();
        int u = cur.u, ci = cur.ci;

        if(!dp[u].count(0) || (dp[u][0] > cur.dist) ){
            dp[u][0] = cur.dist; pq.push_back({cur.dist, u, 0});
        }

        if(ci)  {
            int pos = lower_bound(vi[u].begin(), vi[u].end(), ii(ci, 0)) - vi[u].begin();
            while(pos < vi[u].size() && vi[u][pos].fi == ci)    {
                int v = vi[u][pos].se;
                if(!dp[v].count(ci) || dp[v][ci] > cur.dist)    {
                    dp[v][ci] = cur.dist; pq.push_front({cur.dist, v, ci});
                }
                pos ++;
            }
        } else {
            for(ii v: vi[u])    {
                if(!dp[v.se].count(v.fi) || dp[v.se][v.fi] > cur.dist + 1)  {
                    dp[v.se][v.fi] = cur.dist + 1;
                    pq.push_back({cur.dist + 1, v.se, v.fi});
                }
            }
        }
    }
    int ans = oo;
    for(auto v: dp[n])  ans = min(ans, v.se);
    if(ans == oo) printf("-1");
    else printf("%d", ans);
}

signed main()
{
	//freopen("test.inp", "r", stdin);
	scanf("%d%d", &n, &m);
	FOR(i, 1, m)    {
        int u, v, ci; scanf("%d%d%d", &u, &v, &ci);
        vi[u].pb(ii(i, v));
        vi[v].pb(ii(i, u));
	}
	for(int i = 1; i <= n; ++i) sort(vi[i].begin(), vi[i].end());
	solve();
}

Submission Info

Submission Time
Task E - Snuke's Subway Trip
User Vinhspm
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1843 Byte
Status WA
Exec Time 356 ms
Memory 44532 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:59:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:61:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int u, v, ci; scanf("%d%d%d", &u, &v, &ci);
                                                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status AC
AC × 24
WA × 35
Set Name Test Cases
Sample
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, sample_01.txt, sample_02.txt, sample_03.txt, w1.txt, w10.txt, w11.txt, w12.txt, w13.txt, w14.txt, w15.txt, w16.txt, w17.txt, w18.txt, w2.txt, w3.txt, w4.txt, w5.txt, w6.txt, w7.txt, w8.txt, w9.txt
Case Name Status Exec Time Memory
01.txt AC 7 ms 14336 KB
02.txt WA 356 ms 39424 KB
03.txt AC 250 ms 43904 KB
04.txt AC 86 ms 20608 KB
05.txt WA 247 ms 43904 KB
06.txt WA 81 ms 31616 KB
07.txt WA 110 ms 33280 KB
08.txt AC 249 ms 44288 KB
09.txt AC 113 ms 33408 KB
10.txt AC 112 ms 33536 KB
11.txt AC 293 ms 43132 KB
12.txt AC 332 ms 40568 KB
13.txt AC 307 ms 40952 KB
14.txt WA 281 ms 43520 KB
15.txt AC 296 ms 43388 KB
16.txt WA 291 ms 43392 KB
17.txt WA 298 ms 43000 KB
18.txt AC 320 ms 40444 KB
19.txt WA 298 ms 43380 KB
20.txt WA 297 ms 43648 KB
21.txt AC 315 ms 43388 KB
22.txt WA 301 ms 42744 KB
23.txt WA 280 ms 43008 KB
24.txt WA 298 ms 43132 KB
25.txt AC 330 ms 40568 KB
26.txt AC 308 ms 40952 KB
27.txt WA 275 ms 43520 KB
28.txt WA 308 ms 43388 KB
29.txt WA 290 ms 43520 KB
30.txt AC 297 ms 43000 KB
31.txt WA 319 ms 40444 KB
32.txt AC 303 ms 43380 KB
33.txt WA 303 ms 43648 KB
34.txt WA 295 ms 43260 KB
35.txt AC 330 ms 40568 KB
36.txt AC 320 ms 40952 KB
37.txt WA 281 ms 43520 KB
38.txt WA 316 ms 43388 KB
sample_01.txt AC 6 ms 14336 KB
sample_02.txt AC 6 ms 14336 KB
sample_03.txt AC 6 ms 14336 KB
w1.txt WA 293 ms 42852 KB
w10.txt AC 103 ms 23808 KB
w11.txt WA 216 ms 36824 KB
w12.txt WA 200 ms 36736 KB
w13.txt WA 181 ms 37376 KB
w14.txt AC 133 ms 32256 KB
w15.txt WA 216 ms 36696 KB
w16.txt WA 199 ms 36608 KB
w17.txt WA 179 ms 37376 KB
w18.txt WA 164 ms 39040 KB
w2.txt WA 304 ms 42844 KB
w3.txt WA 246 ms 44532 KB
w4.txt WA 242 ms 44532 KB
w5.txt AC 250 ms 44532 KB
w6.txt WA 245 ms 44532 KB
w7.txt WA 220 ms 36628 KB
w8.txt WA 205 ms 36608 KB
w9.txt WA 185 ms 37376 KB