# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899183 | LCJLY | Painting Walls (APIO20_paint) | C++14 | 1589 ms | 56340 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 "paint.h"
#include <bits/stdc++.h>
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
using namespace std;
int n,m,k;
int arr[100005];
unordered_set<int>check[500005];
int memo[100005];
vector<int>color[100005];
int dp(int index){
if(index==n) return 0;
else if(index>n-m) return INT_MAX/3;
if(memo[index]!=-1) return memo[index];
int ans=INT_MAX/3;
//check
bool amos=false;
//for(int x=0;x<m;x++){
//bool hayden=true;
//for(int y=0;y<m;y++){
//if(check[x+y].find(arr[index+y])==check[x+y].end()) hayden=false;
//}
//amos|=hayden;
//}
# | 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... |