oj.uz

답안 #957285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957285 2024-04-03T11:57:21 Z amine_aroua Toll (BOI17_toll) C++17
0 / 100
 50 ms 28824 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>
#define vvi vector<vi>
#define vvii vector<vii>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)

// HERE IS THE SOLUTION
int N , K , M , O;
const int LOG = 15;
int lim;
vvii adj;
vector<vi> comb(vector<vi> a , vector<vi> b)
{
    vector<vi> target(K , vi(K , INF));
    fore(x , K)
    {
        fore(y , K)
        {
            fore(z , K)
            {
                target[x][y] = min(target[x][y]  , a[x][z] + b[z][y]);
            }
        }
    }
    return target;
}
vector<vvi> tree;
void build(int node , int l , int r)
{
    if(r == l + 1)
    {
        forr(a , l * K , l * K + K - 1)
        {
            for(auto [b , t] : adj[a])
            {
                tree[node][a%K][b%K] = min(tree[node][a%K][b%K] , t);
            }
        }
        return ;
    }
    int mid = (l + r)/2;
    build(2*node , l , mid);
    build(2*node + 1 , mid , r);
    tree[node] = comb(tree[2*node] , tree[2*node + 1]);
}
vvi query(int node , int L , int R , int l , int r)
{
    if(l <= L && R <= r)
        return tree[node];
    int mid = (L + R)/2;
    if(r <= mid)
        return query(2*node , L , mid , l , r);
    if(l >= mid)
        return query(2*node + 1, mid , R , l, r);
    return comb(query(2*node , L , mid , l , r) , query(2*node + 1 , mid , R , l , r));
}
signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    cin>>K>>N>>M>>O;
    lim = (N+ K - 1)/K;
    adj.resize(N + K + 1);
    while(__builtin_popcount(lim) != 1)
    {
        lim++;
    }
    tree.assign(2*lim , vvi(K , vi(K , INF)));
    fore(i , M)
    {
        int a , b ,t;
        cin>>a>>b>>t;
        adj[a].pb({b , t});
    }
    build(1 , 0 , lim);
    while(O--)
    {
        int a , b;
        cin>>a>>b;
        if(a/K == b/K)
        {
            cout<<-1<<nl;
            continue;
        }
        int ans = query(1 , 0 , lim , a/K , b/K)[a%K][b%K];
        cout<<(ans >= INF ? -1 : ans)<<nl;
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 50 ms 28824 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 47 ms 27728 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 50 ms 28824 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -