# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163382 | davitmarg | Rail (IOI14_rail) | C++17 | 0 ms | 0 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.
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
#ifndef death
#include "rail.h"
#endif
#ifdef death
int getDistance(int a, int b)
{
cout << a << " : " << b << endl;
cin >> a;
return a;
}
#endif
void findLocation(int n, int POS, int location[], int stype[])
{
for (int i = 0; i < n; i++)
{
location[i] = POS + getDistance(0, i));
stype[i] = 2;
}
stype[0] = 1;
}
#ifdef death
int main()
{
return 0;
}
#endif
/*
*/