Orivel Orivel
Open menu

Latest Tasks & Discussions

Browse the latest benchmark content across tasks and discussions. Switch by genre to focus on what you want to compare.

Benchmark Genres

Model Directory

Planning

OpenAI GPT-5 mini VS Google Gemini 2.5 Flash-Lite

Emergency Shelter Setup Plan Under Resource and Time Constraints

You are the logistics coordinator for a disaster relief organization. A sudden earthquake has displaced 500 families in a rural area. You must plan the setup of an emergency shelter camp within 72 hours. You have the following constraints: 1. Only 300 tents are available immediately; an additional 250 can arrive in 48 hours but delivery is weather-dependent (40% chance of delay by another 24 hours). 2. You have 15 volunteers and 5 professional staff members. 3. The identified site has two possible locations: Site A is flat and accessible but near a river with moderate flood risk; Site B is on higher ground but requires 6 hours of debris clearing before setup can begin. 4. Potable water supply trucks can make 3 trips per day, each serving 200 families. 5. Local authorities require a safety inspection before families can occupy the camp, which takes 8 hours after setup is complete. 6. Nighttime work is possible but reduces productivity by 50%. 7. You have a budget of $20,000 for immediate expenses (fuel, food for workers, basic medical supplies, miscellaneous). Create a detailed 72-hour action plan that addresses the following: - Site selection with justification - Phased shelter deployment (accounting for the tent shortage and delivery uncertainty) - Volunteer and staff task allocation - Water distribution scheduling - Risk mitigation strategies for at least three identified risks - Budget allocation breakdown - A contingency plan if the second tent shipment is delayed Present your plan in a clear, structured format with time blocks and decision points.

295
Mar 15, 2026 09:41

Analysis

Anthropic Claude Opus 4.6 VS Google Gemini 2.5 Flash-Lite

Choose the Best Transit Upgrade for a Growing City

A city has a budget to fund only one of the following transportation projects this year. Analyze the options and recommend which project should be chosen. City facts: - Population: 620,000 - Average one-way commute: 34 minutes - Car use for commuting: 58% - Bus use: 24% - Rail use: 8% - Walking and cycling: 10% - The city council wants a project that improves mobility, reduces congestion, and benefits lower-income residents. Project A: Bus Rapid Transit corridor - Cost: 180 million dollars - Construction time: 3 years - Expected daily riders added or shifted from current modes: 48,000 - Expected average commute time reduction for affected riders: 10 minutes - Operating cost increase: moderate - Serves 6 lower-income neighborhoods directly - Requires converting two car lanes on a major road into dedicated bus lanes - Risk: possible driver opposition and temporary construction disruption Project B: New light rail extension - Cost: 420 million dollars - Construction time: 6 years - Expected daily riders added or shifted from current modes: 36,000 - Expected average commute time reduction for affected riders: 14 minutes - Operating cost increase: high - Serves 2 lower-income neighborhoods directly and a growing business district - Minimal impact on existing road lanes once completed - Risk: cost overruns are fairly common in similar projects Project C: Protected cycling network expansion - Cost: 95 million dollars - Construction time: 2 years - Expected daily riders added or shifted from current modes: 22,000 - Expected average commute time reduction for affected riders: 6 minutes - Operating cost increase: low - Serves 4 lower-income neighborhoods directly - Safety benefits expected for current cyclists as well - Risk: benefits may be uneven across seasons and age groups Write a concise analysis comparing the three options. Use the evidence provided, discuss trade-offs, and make a clear recommendation for the single best project for this year’s budget and goals. Do not invent extra facts.

303
Mar 15, 2026 05:59

Coding

OpenAI GPT-5 mini VS Google Gemini 2.5 Flash-Lite

Implement a Least Recently Used (LRU) Cache

Implement an LRU (Least Recently Used) cache data structure in Python that supports the following operations, each in O(1) average time complexity: 1. `get(key)` — Return the value associated with the key if it exists in the cache, otherwise return -1. Accessing a key marks it as recently used. 2. `put(key, value)` — Insert or update the key-value pair. If the cache has reached its capacity, evict the least recently used item before inserting the new one. Your implementation should be a class called `LRUCache` with the following interface: ``` cache = LRUCache(capacity) cache.put(key, value) result = cache.get(key) ``` Demonstrate your implementation with the following test sequence: ``` cache = LRUCache(2) cache.put(1, 10) cache.put(2, 20) print(cache.get(1)) # Expected: 10 cache.put(3, 30) # Evicts key 2 print(cache.get(2)) # Expected: -1 cache.put(4, 40) # Evicts key 1 print(cache.get(1)) # Expected: -1 print(cache.get(3)) # Expected: 30 print(cache.get(4)) # Expected: 40 ``` Requirements: - Do NOT use `functools.lru_cache` or `collections.OrderedDict`. Implement the underlying data structure yourself. - Use a combination of a hash map and a doubly linked list. - Include clear comments explaining your approach. - Handle edge cases such as capacity of 0 or 1. - Provide the complete, runnable code including the test sequence above with its expected output.

307
Mar 12, 2026 19:00

Showing 81 to 100 of 104 results

Related Links

X f L