# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656220 | Hydroxic_Acid | Kamenčići (COCI21_kamencici) | C++17 | 81 ms | 175460 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 <iostream>
#include <cstring>
using namespace std;
int N, K;
int seq[355];
int prefleft[355];
int prefright[355];
int dptable[355][355][355];
bool dp(int i, int j, int k){
if(k == 0){
return dptable[i][j][k] = 0;
}
if(dptable[i][j][k] != -1){
return dptable[i][j][k];
}
if((prefleft[i] + prefright[j] - seq[i] - seq[j] - K + k) >= K){
return dptable[i][j][k] = 1;
}
if((i + N - j + 1) % 2 == 0){
dptable[i][j][k] = dp(i + 1, j, k - seq[i]) || dp(i, j - 1, k - seq[j]);
} else {
dptable[i][j][k] = dp(i + 1, j, k) && dp(i, j - 1, k);
}
return dptable[i][j][k];
}
int main(){
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... |