Submission #282499

#TimeUsernameProblemLanguageResultExecution timeMemory
282499shayan_pRail (IOI14_rail)C++14
8 / 100
83 ms512 KiB
#include<bits/stdc++.h>
#include "rail.h"

#define F first
#define S second
#define sz(s) (int(s.size()))
#define PB push_back
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

const int maxn = 1e5 + 10, mod = 1e9 + 7, inf = 1e9 + 10;

void findLocation(int n, int p, int location[], int stype[]){
    stype[0] = 1;
    for(int i = 1; i < n; i++)
	stype[i] = 2;
    location[0] = p;
    for(int i = 1; i < n; i++)
	location[i] = getDistance(0, i) + p;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...