제출 #636959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
636959		VasLemmy	Commuter Pass (JOI18_commuter_pass)	C++17	24 / 100	184 ms	143536 KiB

commuter_pass

#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
/*#pragma GCC tarGet ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC tarGet("avx,avx2,fma")*/
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldb = long double;
const int N = 1e5;
const int maxN = 2e5 + 1;
const int mod = 1e9 + 7;
const int block_size = 700;
const ll infty = 1e18;

int n,m;
int s,t;
int u,v;
ll d[3003][3003];

void Read()
{
    cin >> n >> m;
    cin >> s >> t;
    cin >> u >> v;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            if(i != j) d[i][j] = infty;
        }
    }
    for(int i = 1;i <= m;i++)
    {
        int a,b,c;
        cin >> a >> b >> c;
        d[a][b] = min(d[a][b],c);
        d[b][a] = min(d[b][a],c);
    }
    for(int k = 1;k <= n;k++)
    {
        for(int i = 1;i <= n;i++)
        {
            for(int j = 1;j <= n;j++)
            {
                d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
            }
        }
    }

    ll res = infty;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            ll p1 = d[u][i] + d[j][v];
            ll p2 = d[i][j];
            if(p2 + d[s][i] + d[j][t] == d[s][t] || p2 + d[s][j] + d[i][t] == d[s][t]) p2 = 0;
            res = min(res,p1 + p2);
        }
    }
    cout << res;
}

void Solve()
{

}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //InputFile();
    //int sub_type;
    //cin >> sub_type;
    //Sieve();
    int test;
    //cin >> test;
    test = 1;
    while(test--)
        //for(int prc = 1; prc <= test; prc++)
    {
        Read();
        Solve();
        //Debug();
    }
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 15
• Subtask 3: 24 / 24
• Subtask 4: 0 / 45