# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515995 | David_M | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 142 ms | 130864 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 ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e13, P=998244353;
int n, ANS;
ll L;
ll dp[205][205][205][2];
void solve(){
cin>>n>>L;
vector<ll> a(n), T(n);
for (auto &x:a)cin>>x;
for (auto &x:T)cin>>x;
for (int i=0; i<=n; i++)
for (int j=0; j<=n; j++)
for (int k=0; k<=n; k++)
dp[i][j][k][0]=dp[i][j][k][1]=INF;
dp[n][0][0][0]=dp[n][0][0][1]=0;
for (int l=n; l>0; l--){
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... |