# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680932 | TranGiaHuy1508 | Collecting Stamps 3 (JOI20_ho_t3) | C++17 | 40 ms | 67736 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;
void main_program();
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
main_program();
}
const int inf = 1e9 + 100;
int n, L;
vector<int> dist[2];
vector<int> T;
int dp[205][205][205][2];
int f(int l, int r, int cnt, int lr){
if (cnt < 0) return -1;
if (dp[l][r][cnt][lr] > -2) return dp[l][r][cnt][lr];
int res = inf;
bool valid = false;
if (lr == 0){
if (l > 0){
int prev1 = f(l-1, r, cnt-1, lr);
int prev2 = f(l-1, r, cnt, lr);
int d = dist[0][l] - dist[0][l-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... |