# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300185 | model_code | Jelly Flavours (IOI20_jelly) | Java | 1065 ms | 226356 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.
// gug-full
import java.util.Arrays;
class IntPair implements Comparable<IntPair> {
final int first, second;
public IntPair(int _first, int _second) {
first = _first;
second = _second;
}
@Override
public int compareTo(IntPair other) {
return first - other.first;
}
}
class jelly {
int find_maximum_unique(int x, int y, int[] a, int[] b) {
int n = a.length;
int[][] fdp = new int[n+1][x+1];
int[][] bdp = new int[n+1][y+1];
IntPair[] c = new IntPair[n];
for (int i = 0; i < n; i++) {
c[i] = new IntPair(a[i], b[i]);
}
Arrays.sort(c);
for(int i = 1; i <= n; i++) {
for(int j = 0; j <= x; j++) {
fdp[i][j] = fdp[i-1][j] + c[i-1].second;
if (j >= c[i - 1].first) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |