# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
607543 | MohamedFaresNebili | Rail (IOI14_rail) | C++14 | 71 ms | 728 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 <bits/stdc++.h>
#include "rail.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
const int MOD = 998244353;
int getDistance(int i, int j);
int DP[5005][5005];
int query(int i, int j) {
if(i == j) return 0;
if(DP[i][j] != -1)
return DP[i][j];
return DP[i][j] = getDistance(i, j);
}
void findLocation(int n, int first, int location[], int stype[]) {
location[0] = first;
stype[0] = 1; int D = first + 1;
for(int l = 1; l < n; l++) {
if(query(0, l) < query(0, D)) D = l;
}
for(int l = 1; l < n; l++) {
int A = query(0, l), B = query(D, l), C = query(0, D);
if(C + D == A) stype[l] = 1, location[l] = A - 2 * C;
else stype[l] = 2, location[l] = first + A;
}
}
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... |