# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131587 | 79brue | Overtaking (IOI23_overtaking) | C++20 | 3 ms | 4424 KiB |
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k; ll L, base_speed;
ll start[1002], speed[1002], arr[1002];
map<ll, ll> mp;
ll stop[1002][1002];
void init(int _L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S){
L = _L, base_speed = X;
for(int i=0; i<N; i++){
if(W[i] <= X) continue;
++n;
start[n] = T[i], speed[n] = W[i] - X;
}
k = M;
for(int i=1; i<=k; i++) arr[i] = S[i-1];
vector<int> order;
for(int i=1; i<=n; i++) order.push_back(i);
sort(order.begin(), order.end(), [&](int a, int b){
return speed[a] > speed[b];
});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |