| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1027090 | YassineBenYounes | Overtaking (IOI23_overtaking) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "overtaking.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
freopen("milkvisits.in", "r", stdin);
freopen("milkvisits.out", "w", stdout);
}
void in(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 1005;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 998244353;
const int sq = 320;
ll e[mx][mx];
ll t[mx][mx];
vl Tm;
int n, m, x;
vl w, s;
void init(int L, int N, vl T, vi W, int X, int M, vi S){
n = N;m = M;x = X;
w = W, s = S;
Tm = T;
}
//t[i][j] : when bus i arrives at sorting station j
ll arrival_time(ll Y){
t[n][0] = Y;
for(int i = 0; i < n;i++){
t[i][0] = Tm[i];
}
for(int j = 1;j < m;j++){
for(int i = 0; i < n;i++){
e[i][j] = t[i][j-1] + w[i] * (s[j] - s[j-1]);
}
e[n][j] = t[n][j-1] + x * (s[j] - s[j-1]);
for(int i = 0; i <= n;i++){
t[i][j] = e[i][j];
for(int k = 0;k <= n;k++){
if(t[k][j-1] < t[i][j-1]){
t[i][j] = max(t[i][j], e[k][j]);
}
}
}
}
return t[n][m-1];
}
/*
int32_t main(){
in();
init(6, 4, {20, 10, 40, 0}, {5, 20, 20, 30}, 10, 4, {0, 1, 3, 6});
cout << arrival_time(50) << endl;
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/