| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 789627 |
2023-07-21T15:14:03 Z |
TB_ |
Toll (BOI17_toll) |
C++17 |
|
3000 ms |
13764 KB |
#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<n;i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
vvpl adj(50001);
int k, n, m, o, from, to, t;
vvl memo(50001, vl(5, 1e16));
vl dfs(int u){
if(u == n-5) return vl(5, 1e16);
vl &res = memo[u];
if(res[0] != (ll)1e16) return res;
if((u/k)%((int)sqrt(n/k)) == ((int)sqrt(n/k)-1)) res = vl(5, 1e16);
for(auto v : adj[u]){
vl temp = dfs(v.F);
if((u/k)%((int)sqrt(n/k)) == ((int)sqrt(n/k))-1){
res[v.F%k] = v.S;
continue;
}
fo(i, k) {
res[i] = min(res[i], temp[i]+v.S);
}
}
return res;
}
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
cin >> k >> n >> m >> o;
n+=5;
fo(i, m){
cin >> from >> to >> t;
adj[from].pb({to, t});
}
fo(i, k) dfs(i);
vl temp = memo[0];
fo(x, o){
// deb(x);
cin >> from >> to;
if(from == to) {
cout << "0\n";
continue;
}else if(to < from){
cout << "-1\n";
continue;
}
vl currentToll(5, 1e16);
currentToll[from%k] = 0;
ll pos = from/k;
if((from/k)/((int)sqrt(n/k))+1 < (to/k)/((int)sqrt(n/k))){
ll toAdd = ((int)sqrt(n/k)-(pos%((int)sqrt(n/k))));
fo(i, toAdd){
vl newToll(5, 1e16);
fo(j, k){
for(auto v : adj[pos*k+j]){
newToll[v.F%k] = min(newToll[v.F%k], currentToll[j]+v.S);
}
}
currentToll = newToll;
pos++;
}
while((pos)/((int)sqrt(n/k))+1 < (to/k)/((int)sqrt(n/k))){
// deb(pos);
pos+=(int)sqrt(n/k);
vl newToll(5, 1e16);
fo(i, k){
fo(j, k){
newToll[j] = min(newToll[j], currentToll[i]+memo[i+pos*k][j]);
}
}
currentToll = newToll;
}
}
while(pos < to/k){
// deb(pos);
vl newToll(5, 1e16);
fo(j, k){
for(auto v : adj[pos*k+j]){
newToll[v.F%k] = min(newToll[v.F%k], currentToll[j]+v.S);
}
}
currentToll = newToll;
pos++;
}
ll ans = currentToll[to%k];
cout << ((ans>=((ll)1e16))?-1:ans) << "\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
195 ms |
13764 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3084 ms |
10124 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4960 KB |
Output is correct |
| 5 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
4 ms |
5040 KB |
Output is correct |
| 7 |
Incorrect |
10 ms |
5076 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4960 KB |
Output is correct |
| 5 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
4 ms |
5040 KB |
Output is correct |
| 7 |
Incorrect |
10 ms |
5076 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
195 ms |
13764 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
