제출 #718415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718415		vinnipuh01	Robot (JOI21_ho_t4)	C++17	0 / 100	3087 ms	1620 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;

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

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

int n, m, x, y, z[ 1001 ], t[ 1001 ];
int mp[ 1001 ][ 2001 ];
vector <pair<int, int> > v[ 1001 ];
int dp[ 1001 ][ 1001 ][ 2 ];

void dfs( int u, int pr, int col ) {
	int num = 0;
	int pos = 0;
	if ( col == 1 ) {
		for ( auto to : v[ u ] ) {
			if ( to.first == pr )
				num = t[ to.second ], pos = z[ to.second ];
		}
	}
	int sum;
	for ( auto to : v[ u ] ) {
		if ( to.first == pr )
			continue;
		if ( z[ to.second ] == pos )
			sum = num;
		else
			sum = 0;
		if ( dp[ to.first ][ u ][ 1 ] > dp[ u ][ pr ][ col ] + t[ to.second ] ) {
			dp[ to.first ][ u ][ 1 ] = dp[ u ][ pr ][ col ] + t[ to.second ];
			dfs( to.first, u, 1 );
		}
		if ( dp[ to.first ][ u ][ 0 ] > dp[ u ][ pr ][ col ] + mp[ u ][ z[ to.second ] ] - t[ to.second ] - sum ) {
			dp[ to.first ][ u ][ 0 ] = dp[ u ][ pr ][ col ] + mp[ u ][ z[ to.second ] ] - t[ to.second ] - sum;
			dfs( to.first, u, 0 );
		}
	}
}

main () {
	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 } );
	}
	for ( int i = 2; i <= n; i ++ ) {
		for ( int j = 1; j <= n; j ++ )
			dp[ i ][ j ][ 1 ] = dp[ i ][ j ][ 0 ] = oo;
	}
	dfs( 1, 0, 0 );
	mn = oo;
	for ( int i = 1; i <= n; i ++ ) {
		if ( dp[ n ][ i ][ 1 ]  < mn )
			mn = dp[ n ][  i][ 1 ];
		if ( dp[ n ][ i ][ 0 ] < mn )
			mn = dp[ n ][ i ][ 0 ];
	}
	if ( mn == oo )
		cout << "-1";
	else
		cout << mn;
}

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

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

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