| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 659117 | ssense | 악어의 지하 도시 (IOI11_crocodile) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
vector<vector<pair<int, int>>> adj(n, vector<pair<int, int>>());
vector<pair<bool, int>> certified(n, {false, MXL});
for(int i = 0; i < m; i++)
{
adj[r[i][1]].pb({r[i][0], l[i]});
adj[r[i][0]].pb({r[i][1], l[i]});
}
for(int i = 0; i < k; i++)
{
certified[p[i]].fr = true;
certified[p[i]].sc = 0;
}
for(int i = 0; i < n; i++)
{
for(int u = 0; u < n; u++)
{
int best = MXL, scbest = MXL;
for(auto node : adj[u])
{
int v = node.fr;
int dist = node.sc;
if(certified[v].fr)
{
scbest = min(scbest, certified[v].sc+dist);
if(scbest < best)
{
swap(scbest, best);
}
}
}
if(scbest != MXL)
{
certified[u].fr = true;
certified[u].sc = scbest;
}
}
}
if(certified[0].fr)
{
//cout << "true" << endl;
return certified[0].sc;
}
else
{
cout << "false" << endl;
return -1;
}
}
/*
int32_t main(){
startt
int n, m, k;
cin >> n >> m;
int r[m][2], l[m];
for(int i = 0; i < m; i++)
{
cin >> r[i][0] >> r[i][1];
}
for(int i = 0; i < m ; i++)
{
cin >> l[i];
}
cin >> k;
int p[k];
for(int i = 0; i < k; i++)
{
cin >> p[i];
}
cout << travel_plan(n, m, r, l, k, p) << endl;
}
*/
/*
5 4
0 1
0 2
3 2
2 4
2
3
1
4
3
1
3
4
*/