Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit709a68c

Browse files
authored
Improved tasks 3457, 3459
1 parentffd7784 commit709a68c

File tree

2 files changed

+120
-61
lines changed

2 files changed

+120
-61
lines changed
Lines changed: 31 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -1,26 +1,39 @@
11
packageg3401_3500.s3457_eat_pizzas;
22

3-
// #Medium #Array #Sorting #Greedy #2025_02_18_Time_63_ms_(40.14%)_Space_81.02_MB_(36.94%)
3+
// #Medium #Array #Sorting #Greedy #2025_02_21_Time_16_ms_(100.00%)_Space_75.98_MB_(97.29%)
44

5-
importjava.util.Arrays;
6-
7-
publicclassSolution {
5+
classSolution {
86
publiclongmaxWeight(int[]pizzas) {
9-
intn =pizzas.length;
10-
intm =n /4;
11-
intz = (m +1) /2;
12-
inty =m /2;
13-
intj =0;
14-
Arrays.sort(pizzas);
15-
longres =0;
16-
for (inti =0;i <z; ++i) {
17-
res +=pizzas[n -1 -j];
18-
j +=1;
7+
intmax =0;
8+
for (intx :pizzas) {
9+
max =Math.max(max,x);
10+
}
11+
int[]count =newint[max +1];
12+
for (intx :pizzas) {
13+
count[x]++;
14+
}
15+
intm =pizzas.length;
16+
intn =m /4;
17+
intindex =0;
18+
for (intx =max;x >0; --x) {
19+
if (count[x] !=0) {
20+
intc =count[x];
21+
while (c-- >0) {
22+
pizzas[index++] =x;
23+
}
24+
if (index >=m /2) {
25+
break;
26+
}
27+
}
28+
}
29+
longans =0;
30+
for (inti =0;i < (n +1) /2; ++i) {
31+
ans +=pizzas[i];
1932
}
20-
for (inti =0;i <y; ++i) {
21-
res +=pizzas[n -1 -j -1];
22-
j +=2;
33+
intk =n - (n +1) /2;
34+
for (inti = (n +1) /2 +1;k >0;i +=2,k--) {
35+
ans +=pizzas[i];
2336
}
24-
returnres;
37+
returnans;
2538
}
2639
}
Lines changed: 89 additions & 43 deletions
Original file line numberDiff line numberDiff line change
@@ -1,60 +1,106 @@
11
packageg3401_3500.s3459_length_of_longest_v_shaped_diagonal_segment;
22

33
// #Hard #Array #Dynamic_Programming #Matrix #Memoization
4-
// #2025_02_18_Time_461_ms_(36.09%)_Space_127.47_MB_(39.48%)
5-
6-
importjava.util.Arrays;
4+
// #2025_02_21_Time_56_ms_(72.97%)_Space_75.44_MB_(91.21%)
75

86
publicclassSolution {
9-
privatefinalint[][]ds = {{1,1}, {1, -1}, {-1, -1}, {-1,1}};
10-
privatefinalint[]nx = {2,2,0};
11-
privateint[][]grid;
12-
privateintn;
13-
privateintm;
14-
privateint[][][][]dp;
7+
privatefinalint[][]directions = {{-1, -1}, {-1,1}, {1,1}, {1, -1}};
158

16-
publicintlenOfVDiagonal(int[][]g) {
17-
this.grid =g;
18-
this.n =g.length;
19-
this.m =g[0].length;
20-
this.dp =newint[n][m][4][2];
21-
for (int[][][]d1 :dp) {
22-
for (int[][]d2 :d1) {
23-
for (int[]d3 :d2) {
24-
Arrays.fill(d3, -1);
25-
}
9+
privatevoidinitializeArrays(
10+
int[][]bottomLeft,
11+
int[][]bottomRight,
12+
int[][]topLeft,
13+
int[][]topRight,
14+
intm,
15+
intn) {
16+
for (inti =0;i <m; ++i) {
17+
for (intj =0;j <n; ++j) {
18+
bottomLeft[i][j] =1;
19+
bottomRight[i][j] =1;
20+
topLeft[i][j] =1;
21+
topRight[i][j] =1;
2622
}
2723
}
28-
intres =0;
29-
for (inti =0;i <n;i++) {
30-
for (intj =0;j <m;j++) {
31-
if (g[i][j] ==1) {
32-
for (intd =0;d <4;d++) {
33-
res =Math.max(res,dp(i,j,1,d,1));
34-
}
24+
}
25+
26+
privateintprocessBottomDirections(
27+
int[][]grid,int[][]bottomLeft,int[][]bottomRight,intm,intn) {
28+
intans =0;
29+
for (inti =0;i <m; ++i) {
30+
for (intj =0;j <n; ++j) {
31+
intx =grid[i][j];
32+
if (x ==1) {
33+
ans =1;
34+
continue;
35+
}
36+
if (i >0 &&j +1 <n &&grid[i -1][j +1] ==2 -x) {
37+
bottomLeft[i][j] =bottomLeft[i -1][j +1] +1;
38+
}
39+
if (i >0 &&j >0 &&grid[i -1][j -1] ==2 -x) {
40+
bottomRight[i][j] =bottomRight[i -1][j -1] +1;
3541
}
3642
}
3743
}
38-
returnres;
44+
returnans;
3945
}
4046

41-
privateintdp(inti,intj,intx,intd,intk) {
42-
if (i <0 ||i >=n ||j <0 ||j >=m) {
43-
return0;
44-
}
45-
if (grid[i][j] !=x) {
46-
return0;
47-
}
48-
if (dp[i][j][d][k] != -1) {
49-
returndp[i][j][d][k];
47+
privatevoidprocessTopDirections(
48+
int[][]grid,int[][]topLeft,int[][]topRight,intm,intn) {
49+
for (inti =m -1;i >=0; --i) {
50+
for (intj =n -1;j >=0; --j) {
51+
intx =grid[i][j];
52+
if (x ==1) {
53+
continue;
54+
}
55+
if (i +1 <m &&j +1 <n &&grid[i +1][j +1] ==2 -x) {
56+
topLeft[i][j] =topLeft[i +1][j +1] +1;
57+
}
58+
if (i +1 <m &&j >0 &&grid[i +1][j -1] ==2 -x) {
59+
topRight[i][j] =topRight[i +1][j -1] +1;
60+
}
61+
}
5062
}
51-
intres =dp(i +ds[d][0],j +ds[d][1],nx[x],d,k) +1;
52-
if (k >0) {
53-
intd2 = (d +1) %4;
54-
intres2 =dp(i +ds[d2][0],j +ds[d2][1],nx[x],d2,0) +1;
55-
res =Math.max(res,res2);
63+
}
64+
65+
privateintfindMaxDiagonal(int[][]grid,int[][][]memo,intm,intn,intinitialAns) {
66+
intans =initialAns;
67+
for (inti =0;i <m; ++i) {
68+
for (intj =0;j <n; ++j) {
69+
intx =grid[i][j];
70+
if (x ==1) {
71+
continue;
72+
}
73+
x >>=1;
74+
for (intk =0;k <4; ++k) {
75+
intv =memo[k][i][j];
76+
if ((v &1) !=x) {
77+
continue;
78+
}
79+
if (v +memo[k +3 &3][i][j] >ans) {
80+
int[]d =directions[k];
81+
intni =i -d[0] *v;
82+
intnj =j -d[1] *v;
83+
if (ni >=0 &&nj >=0 &&ni <m &&nj <n &&grid[ni][nj] ==1) {
84+
ans =Math.max(ans,v +memo[k +3 &3][i][j]);
85+
}
86+
}
87+
}
88+
}
5689
}
57-
dp[i][j][d][k] =res;
58-
returnres;
90+
returnans;
91+
}
92+
93+
publicintlenOfVDiagonal(int[][]grid) {
94+
intm =grid.length;
95+
intn =grid[0].length;
96+
int[][]bottomLeft =newint[m][n];
97+
int[][]bottomRight =newint[m][n];
98+
int[][]topLeft =newint[m][n];
99+
int[][]topRight =newint[m][n];
100+
initializeArrays(bottomLeft,bottomRight,topLeft,topRight,m,n);
101+
intans =processBottomDirections(grid,bottomLeft,bottomRight,m,n);
102+
processTopDirections(grid,topLeft,topRight,m,n);
103+
int[][][]memo = {topLeft,topRight,bottomRight,bottomLeft};
104+
returnfindMaxDiagonal(grid,memo,m,n,ans);
59105
}
60106
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp