# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750732 | Sami_Massah | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 2077 ms | 212 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>
using namespace std;
const long long maxn = 200 + 12, inf = 1e9 + 12;
int n, L, dist[maxn], t[maxn];
vector <int> pos, anses;
int get_dist(int a, int b){
if(a > b)
swap(a, b);
int x = abs(a - b);
x = min(x, L - b + a);
return x;
}
int main(){
cin >> n >> L;
// n = 10;
// L= 100;
for(int i = 0; i < n; i++){
cin >> dist[i];
// dist[i] = rand() % (L - 1) + 1;
}
for(int i = 0; i < n; i++){
// t[i] = rand() % (100);
cin >> t[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... |