# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
957288 |
2024-04-03T12:09:18 Z |
amine_aroua |
Toll (BOI17_toll) |
C++17 |
|
61 ms |
11772 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;
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;
vvi query(int l , int r)
{
l+=lim;
r+=lim;
vvi res(K , vi(K , 0));
while(l < r)
{
if(l%2)
res = comb(res , tree[l++]);
if(r%2 == 0)
res = comb(res , tree[r--]);
l>>=1;
r>>=1;
}
if(l == r)
res = comb(res ,tree[l]);
return res;
}
signed main()
{
boost;
cin.tie(0);
cout.tie(0);
cin>>K>>N>>M>>O;
lim = (N+ K - 1)/K;
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;
tree[lim + (a/K)][a%K][b%K] = min(tree[lim + (a/K)][a%K][b%K] , t);
}
forn(i , lim - 1 , 1)
{
tree[i] = comb(tree[2*i] , tree[2*i + 1]);
}
while(O--)
{
int a , b;
cin>>a>>b;
if(a/K == b/K)
{
cout<<-1<<nl;
continue;
}
int ans = query(a/K , (b/K) - 1)[a%K][b%K];
if(ans == INF)
cout<<-1<<nl;
else
cout<<ans<<nl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
61 ms |
11608 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
604 KB |
Output is correct |
6 |
Correct |
2 ms |
640 KB |
Output is correct |
7 |
Correct |
2 ms |
600 KB |
Output is correct |
8 |
Correct |
46 ms |
11612 KB |
Output is correct |
9 |
Correct |
53 ms |
11772 KB |
Output is correct |
10 |
Correct |
38 ms |
11612 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
52 ms |
10076 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
396 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
396 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
61 ms |
11608 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
604 KB |
Output is correct |
6 |
Correct |
2 ms |
640 KB |
Output is correct |
7 |
Correct |
2 ms |
600 KB |
Output is correct |
8 |
Correct |
46 ms |
11612 KB |
Output is correct |
9 |
Correct |
53 ms |
11772 KB |
Output is correct |
10 |
Correct |
38 ms |
11612 KB |
Output is correct |
11 |
Incorrect |
52 ms |
10076 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |