제출 #235306

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
235306	2020-05-27 16:15:38	eohomegrownapps	Toll (BOI17_toll)	C++14	100 / 100	602 ms	16632 KiB

toll

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;
vector<vector<pair<int,int>>> adjlist;
int k,n,num;
int INF = 1e9;
pair<int,int> toCoord(int x){
  return {x/k,x%k};
}
vector<vector<int>> combine(vector<vector<int>> a, vector<vector<int>> b, int m){
  //cout<<m<<endl;
  //x - index of rightmost connector
  vector<vector<int>> ans(k,vector<int>(k,INF));
  for (int i = 0; i<k; i++){
    for (int j = 0; j<k; j++){
      //get from a[i][_] to b[_][j]
      int mindist = INF;
      for (int x = 0; x<k; x++){
        if (a[i][x]==INF){continue;}
        for (auto v : adjlist[m*k+x]){
          //cout<<v.first<<" "<<v.second<<endl;
          int node = (v.first)%k;
          int dist = v.second;
          //cout<<node<<endl;
          if (b[node][j]==INF){continue;}
          mindist=min(mindist,a[i][x]+b[node][j]+dist);
        }
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44