# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861457 | gurkot | Overtaking (IOI23_overtaking) | C++17 | 3 ms | 11356 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 "overtaking.h"
#include <iostream>
#include <algorithm>
#include <vector>
//#include <cstdlib>
using namespace std;
int n,m,x;
long long t[1001][1001]; int w[1001][1001];
int s[1001];
void init(int L, int N, std::vector<long long> T, std::vector<int> W,
int X, int M, std::vector<int> S) {
n=0; m=M; x=X;
for (int i=0;i<M;i++)s[i]=S[i];
int nom;
for (int i=0;i<N;i++)
if (W[i]>X) {
w[0][n]=W[i];t[0][n]=T[i];
nom=n;
while (nom>0)
if (t[0][nom]==t[0][nom-1] && w[0][nom]>w[0][nom-1])
{swap(t[0][nom],t[0][nom-1]);swap(w[0][nom],w[0][nom-1]);nom--;}
else break;
n++;
}
//counting without reserve bus (precalculation)
Compilation message (stderr)
# | 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... |