제출 #718529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718529		vinnipuh01	Robot (JOI21_ho_t4)	C++17	100 / 100	614 ms	55572 KiB

Main

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
#define sqrt sqrtl

using namespace std;

const long long oo = 1000000000000000000;

long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;


    freopen ( "sum.in", "r", stdin )
*/

struct Node {
	int dp, u;
};

vector <int> vv;

struct cmp {
	bool operator () ( const Node& a, const Node& b ) const {
		if ( a.dp == b.dp ) {
			return a.u < b.u;
		}
		return a.dp < b.dp;
	}
};

int n, m, x, y, z[ 200001 ], t[ 200001 ];
map <int, int> mp[ 100001 ], mpp[ 200001 ];
int dp[ 200001 ];
int dpp[ 200001 ];
vector <pair<int, int> > v[ 100001 ];
set <Node, cmp > st;


main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for ( int i = 1; i <= m; i ++ ) {
		cin >> x >> y >> z[ i ] >> t[ i ];
		mp[ x ][ z[ i ] ] += t[ i ];
		mp[ y ][ z[ i ] ] += t[ i ];
		v[ x ].push_back( { y, i } );
		v[ y ].push_back( { x, i } );
		dpp[ i ] = oo;
	}
	for ( int i = 1; i <= n; i ++ )
		dp[ i ] = oo;
	dp[ 1 ] = 0;
	st.insert( { 0, 1 } );
	while ( st.size() ) {
		Node u = *st.begin();
		st.erase( st.begin() );
		for ( auto to : v[ u.u ] ) {
			dpp[ z[ to.second ] ] = min( dpp[ z[ to.second ] ], dp[ to.first ] );
		}
		for ( auto to : v[ u.u ] ) {
			if ( dp[ to.first ] > u.dp + t[ to.second ] ) {
				st.erase( { dp[ to.first ], to.first } );
				dp[ to.first ] = u.dp + t[ to.second ];
				st.insert( { dp[ to.first ], to.first } );
			}
			if ( dp[ to.first ] > u.dp + mp[ u.u ][ z[ to.second ] ] - t[ to.second ] ) {
				st.erase( { dp[ to.first ], to.first } );
				dp[ to.first ] = u.dp + mp[ u.u ][ z[ to.second ] ] - t[ to.second ];
				st.insert( { dp[ to.first ], to.first } );
			}
			if ( dp[ to.first ] > dpp[ z[ to.second ] ] + mp[ u.u ][ z[ to.second ] ] - t[ to.second ] ) {
				st.erase( { dp[ to.first ], to.first } );
				dp[ to.first ] = dpp[ z[ to.second ] ] + mp[ u.u ][ z[ to.second ] ] - t[ to.second ];
				st.insert( { dp[ to.first ], to.first } );
			}
		}
		for ( auto to : v[ u.u ] )
			dpp[ z[ to.second ] ] = oo;
	}
	mn = dp[ n ];
	if ( mn == oo )
		cout << "-1\n";
	else
		cout << mn << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:68:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   68 | main () {
      | ^~~~

• Subtask 1: 34 / 34
• Subtask 2: 24 / 24
• Subtask 3: 42 / 42