# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
405246 | | blue | 철로 (IOI14_rail) | C++17 | | 85 ms | 460 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 <iostream>
#include <vector>
using namespace std;
/*
0 is of type C.
When we query(0, i)
if(location[0] < location[i])
*/
void findLocation(int n, int first, int location[], int stype[])
{
location[0] = first;
stype[0] = first;
for(int i = 1; i < n; i++)
{
location[i] = first + getDistance(0, i);
stype[i] = 1;
}
}
# | 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... |