제출 #423884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423884		vanic	Shortcut (IOI16_shortcut)	C++14	0 / 100	2 ms	460 KiB

shortcut

#include "shortcut.h"
#include <algorithm>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <cassert>
#include <iostream>

using namespace std;

typedef long long ll;

const int maxn=505;

vector < pair < ll, ll > > ms[maxn];
bitset < maxn > bio;
ll n;
ll br;

ll kreni(ll x){
	set < pair < ll, ll > > s;
	s.insert({0, x});
	pair < ll, ll > p;
	ll zadnj;
	while(!s.empty()){
		p=*s.begin();
		s.erase(s.begin());
//		cout << "a sad je  " << p.second << endl;
		if(bio[p.second]){
//			cout << "cont" << endl;
			continue;
		}
		zadnj=p.first;
		bio[p.second]=1;
		x=p.second;
		for(int i=0; i<(int)ms[x].size(); i++){
			if(!bio[ms[x][i].first]){
//				cout << "sirim " << p.first << ' ' << ms[x][i].second << ' ' << ms[x][i].first  << endl;
				s.insert({p.first+ms[x][i].second, ms[x][i].first});
			}
		}
	}
//	cout << x << ' ' << zadnj << endl;
	return zadnj;
}

ll rijesi(){
	ll sol=0;
	for(int i=0; i<br; i++){
		sol=max(sol, kreni(i));
		bio.reset();
	}
	return sol;
}

ll find_shortcut(int nn, vector < int > l, vector < int > d, int c){
	n=nn;
	assert(n<=10);
	for(int i=0; i<n-1; i++){
		ms[i].push_back({i+1, l[i]});
		ms[i+1].push_back({i, l[i]});
	}
	br=n;
	for(int i=0; i<n; i++){
		if(d[i]){
			ms[br].push_back({i, d[i]});
			ms[i].push_back({br, d[i]});
			br++;
		}
	}
	ll sol=1e18;
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
			ms[i].push_back({j, c});
			ms[j].push_back({i, c});
			sol=min(sol, rijesi());
			ms[i].pop_back();
			ms[j].pop_back();
		}
	}
	return sol;
}

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

shortcut.cpp: In function 'll kreni(ll)':
shortcut.cpp:46:9: warning: 'zadnj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   46 |  return zadnj;
      |         ^~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3