Submission #601742

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
601742	2022-07-22 09:32:32	CaoHuuKhuongDuy	Cities (BOI16_cities)	C++17	0 / 100	339 ms	46620 KiB

cities

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
const int N =  1e5 + 9;
const ll oo = 1e17;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
int n,m,k,city[7];
ll f[N][1 << 5],dist[6][N];
vector <ii> a[N];
vector <int> Newcity[1 << 5];
void Dist(ll f[],int x)
{
    for (int i = 1;i <= n;i++)
      f[i] = oo;
    priority_queue <ii,vector <ii>,greater <ii> > q;
    f[x] = 0;
    q.push({0,x});
    ll val;
    while (!q.empty())
      {
        val = q.top().first;
        x = q.top().second;
        q.pop();
        if (f[x] != val) continue;
        for (ii xnew:a[x])
          if (f[xnew.first] > f[x] + xnew.second)
            {
              f[xnew.first] = f[x] + xnew.second;
              q.push({f[xnew.first],xnew.first});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 22
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 26