# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471654 | FatihSolak | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 551 ms | 539936 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>
#define N 205
#define int long long
using namespace std;
int x[2*N],t[2*N];
int dp[2*N][2*N][N][2];
int L;
int go(int a,int b,int dir){
if(dir == 0){
return (x[a] - x[b] + L)%L;
}
return (x[b] - x[a] +L)%L;
}
void solve(){
for(int i=0;i<2*N;i++){
for(int j=0;j<2*N;j++){
for(int c=0;c<N;c++){
for(int d=0;d<2;d++){
dp[i][j][c][d] = 2e18;
}
}
}
}
int n;
cin >> n >> L;
n++;
dp[n+1][n+1][0][0] = 0;
for(int i=2;i<=n;i++){
cin >> x[i];
}
# | 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... |