제출 #770605

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
770605	2023-07-01 14:09:28	MEGalodon	Toll (BOI17_toll)	C++14	100 / 100	126 ms	11888 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>
#define MAXN 50001
#define INF 100000000000000
#define ii pair<int, int>
#define iii pair<ii, int>
#define ll long long
using namespace std;
ll dist[MAXN][5][5];
ll ans[MAXN];
int K, N, M, O;
ll weights[5][5][MAXN];
void dnc(int l, int r, vector<iii> q){
    if( l == r ){
        for( auto x : q ) ans[x.second] = -1;
        return;
    }
    int m = (l+r)/2;
    for( int i{0} ; i < K ; ++i ) for( int j{0} ; j < K ; ++j ){
        if( i == j ) dist[m][i][j] = 0;//, dist[m+1][i][j] = 0;
        else dist[m][i][j] = INF;//, dist[m+1][i][j] = INF;
    }
    for( int lev{m-1} ; lev >= l ; --lev ){
        for( int i{0} ; i < K ; ++i ) for( int k{0} ; k < K ; ++k ){
            dist[lev][i][k] = INF;
            for( int j{0} ; j < K ; ++j ){
                dist[lev][i][k] = min(dist[lev+1][j][k]+weights[i][j][lev], dist[lev][i][k]);
            }
        }
    }
    for( int lev{m+1} ; lev <= r ; ++lev ){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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