# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12713 | ainta | Rail (IOI14_rail) | C++98 | 126 ms | 4684 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 "rail.h"
#include<algorithm>
using namespace std;
#define MAX_M 1000010
int D1[5010], D2[5010];
int loc[5010];
int typ2[MAX_M];
int CL, CR;
struct AA{
int dis, num;
bool operator<(const AA &p)const{
return dis < p.dis;
}
}L[5010], R[5010];
void Add(int p, int a, int b){
loc[p] = a;
typ2[a] = b;
}
void Do(int p, int a, int d){
if (typ2[loc[a]] == 1)Add(p, loc[a] + d, 2);
else Add(p, loc[a] - d, 1);
}
void findLocation(int N, int first, int location[], int stype[])
{
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... |