This https://codeforces.net/contest/1956/submission/256474898 solution consumes at least (2 * n + 1) * sizeof(int)
bytes, on the test #4 the memory usage must be at least 1_600_004
bytes instead of 56 KB
.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
This https://codeforces.net/contest/1956/submission/256474898 solution consumes at least (2 * n + 1) * sizeof(int)
bytes, on the test #4 the memory usage must be at least 1_600_004
bytes instead of 56 KB
.
https://codeforces.net/contest/1846/submission/215981788
The code (Ruby) below is a solution for https://leetcode.com/problems/uncrossed-lines/
Note: In Ruby Array#shift is O(1)
The trick is on the lines 3-4:
def max_uncrossed_lines a, b
# These two lines
c = a.to_set & b.to_set
a, b = *[a, b].map! { | v | v.filter { c === _1 } }
s = 0
while !a.empty? && a.first == b.first
a.shift
b.shift
s += 1
end
while !a.empty? && a.last == b.last
a.pop
b.pop
s += 1
end
r0, r1 = *Array.new(2) { [0] * (b.size + 1) }
for x in a
for y, j in b.each_with_index
r1[j + 1] = (x == y) ?
1 + r0[j] :
[r0[j + 1], r1[j]].max
end
r0, r1 = r1, r0
end
s + r0.last
end
Name |
---|