Submission #1222401

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222401		thelegendary08	Overtaking (IOI23_overtaking)	C++17	0 / 100	0 ms	328 KiB

overtaking

#include "overtaking.h"
#include<bits/stdc++.h>
#define int long long
#define f0r(i,n) for(int i = 0; i<n; i++)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define vpii vector<pii>
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define vb vector<bool>
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<endl;
using namespace std;
int l, n, nspeed, m;
vi t, speed, s;
void init(signed L, signed N, std::vector<long long> T, std::vector<signed> W, signed X, signed M, std::vector<signed> S)
{	
	l=L; n=N; t=T; nspeed=X; m=M; 
	speed.resize(n); f0r(i,n)speed[i] = W[i];
	s.resize(n); f0r(i,n)s[i] = S[i];
    return;
}

long long arrival_time(long long y)
{
	if(n == 1){
		if(nspeed <= speed[0])return y + l * nspeed;
		else{
			if(y <= t[0])return y + l * nspeed;
			else{
				double dif = (y - t[0]) / (speed[0] + 0.0); //position of 0 when 1 departs
				double nxtp = dif * (nspeed - speed[0]); // time taken to catch up
				double pos = nxtp / (nspeed + 0.0);
				int lo = 0; int hi = m; //find first sorting station >= pos
				while(lo < hi){
					int mid = lo + (hi - lo) / 2;
					if(s[mid] >= pos){
						hi = mid;
					}
					else{
						lo = mid + 1;
					}
				}
				if(lo == m)return y + l * nspeed;
				else{
					return t[0] + speed[0] * s[lo] + (s[m-1] - s[lo]) * nspeed;
				}
			}
		}
	}
	
    return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35