# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
639278 | blue | Peru (RMI20_peru) | C++17 | 1 ms | 340 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 "peru.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using ll = long long;
using vll = vector<ll>;
const ll inf = 1'000'000'000'000'000'000LL;
const ll mod = 1'000'000'007;
ll mul(ll a, ll b)
{
return (a*b)%mod;
}
ll ad(ll a, ll b)
{
return (a+b)%mod;
}
int solve(int N, int K, int* v)
{
vll dp(1+N, inf);
dp[0] = 0;
for(int i = 1; i <= N; i++)
{
int rmx = 0;
for(int j = i-1; j >= i-K && j >= 0; j--)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |