# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341984 | Marlov | Rail (IOI14_rail) | C++14 | 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.
/*
Code by @marlov
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
#include <bitset>
#include <rail.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
void findLocation(int n, int first, vector<int> location, vector<int> stype){
for(int i=0;i<n;i++){
location[i]=first+getDistance(0,i);
stype[i]=2;
}
stype[0]=1;
}
/*
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
return 0;
}
*/
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1,n=0?)
* do smth instead of nothing and stay organized
*/