# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134718 | Mahdi_Jfri | Shortcut (IOI16_shortcut) | C++14 | 236 ms | 2552 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 "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 5e2 + 20;
ll s[maxn] , pf[maxn] , sf[maxn] , mxp[maxn] , mxs[maxn];
int d[maxn];
ll mx[maxn][maxn];
ll fn(int a , int b)
{
if(a > b)
swap(a , b);
return s[b] - s[a];
}
long long find_shortcut(int n, std::vector<int> L, std::vector<int> D, int c)
{
for(int i = 0; i < n; i++)
{
d[i] = D[i];
if(i)
s[i] = L[i - 1] + s[i - 1];
# | 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... |
# | 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... |