Submission #626670

#	Time	Username	Problem	Language	Result	Execution time	Memory
626670		Karliver	Robot (JOI21_ho_t4)	C++17	0 / 100	132 ms	15348 KiB

Main

	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)


void solve() {
	
	int n;
	cin >> n;
	int m;
	cin >> m;
	
	vector<vector<int>> g(n);
	vector<int> c(m), p(m), a(m), b(m);
	
	for(int i = 0;i < m;++i) {
		cin >> a[i] >> b[i] >> c[i] >> p[i];
		--a[i];
		--b[i];
		--c[i];
		g[a[i]].push_back(i);
		g[b[i]].push_back(i);
	}
	
	priority_queue<PR<int>, V<PR<int>>, greater<PR<int>>> pq;
	
	pq.push({0, 0});
	
	vector<int> d(n, INF);
	d[0] = 0;
	vector<int> cnt(m);
	while(size(pq)) {
		auto [s, v] = pq.top();
		pq.pop();
		if(d[v] != s)continue;
		for(int i : g[v]) cnt[c[i]] += 1;
		for(int i : g[v]) {
			int y = v ^ a[i] ^ b[i];
			int ns = cnt[c[i]] > 1;
			if(ckmi(d[y], s+ns)) {
				pq.push({d[y], y});
			}
		}
		for(int i : g[v]) cnt[c[i]] -= 1;
	}
	
	cout << (d[n - 1] == INF ? -1 : d[n - 1]) << '\n';
	
		
	

}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

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