The 8VC Venture Cup 2017 - Final Round is tommorrow at 18:05 UTC. Along with that, Codeforces Round #393 will be held at the same time both for Div. 1 and Div. 2 participants. The Div. 1 Edition will contain the same problems as the Final Round, the Div. 2 Edition will be easier.

Of course, those who have placed in top 200 in 8VC Venture Cup 2017 - Elimination Round should register for the Final Round, all the others should register for Div. 1 or Div. 2 editions according to their rating. All three contests will contain six problems, last two hours and be rated.

Hello everyone! The first round of the 8VC Venture Cup 2017 will be held on Sunday.

I am honoured to be the problemsetter of the round. Reyna helped me a lot. Huge applause to KAN for his valuable coordinator's help, and MikeMirzayanov for his admirable work for the Codeforces comunity. I also want to thank testers very much (Alexey ashmelev Shmelev and Alex AlexFetisov Fetisov).

This round is a first stage of 8VC Venture Cup 2017. If you want to acknowledge yourselves with the competition, try here.

The main character of the round is PolandBall. It's a small friendly Ball who lives in a forest along with other Balls. You'll surely like it :)

I tried to fulfill your demands with a various, interesting and challenging problems described in a concise way.

Hope to see you soon, good luck and have fun!

UPD1: Scoring500 — 1000 — 1500 — 2250 — 2500 — 2750 — 3500.

UPD2 Thank you for participation! Contest is over. Did you like the problemset? Feel free to comment =)

8VC will be hosting a coding championship on Codeforces. The championship will begin on January 15 and take place in 2 rounds.

The contest will occur in two rounds:

The Elimination Round is online and takes place on January 15, 17:05 (UTC). Elimination Round follows regular Codeforces rules and consists of 7-8 problems. For this round, the complexity of the problems will be comparable to a regular Codeforces round. There are no eligibility restrictions to participate in the round.

The Final Round takes place on January 22, consists of 5-6 problems, and uses regular Codeforces rules. The complexity of the problems is higher than a regular Codeforces round. We will invite the top local finishers in Elimination Round to Woodside, CA to compete in the Final Round. In addition, we will invite the top 200 overall finishers to compete online.

Cool prizes are offered to winners and best participants.

PRIZES

Overall 1st place — $2000

Overall 2nd place — $1000

Overall 3rd-5th places — $500 each

Overall 1-50th place — t-shirts with 8VC and company logos

Local Winner — Dinner with Joe Lonsdale (founder of Palantir, Addepar and 8VC) and other Silicon Valley technologists

Local top finishers — Opportunity to meet with leadership from 8VC portfolio companies

ABOUT 8VC

8VC, which consists of Joe Lonsdale (co-founder of Palantir) and his core team from Formation | 8, is a Silicon Valley venture capital firm that invests in industry-transforming technology companies. The team's investment portfolio includes companies such as the selected companies below, and a host of other top technology platforms that leverage modern algorithms and data science to power their core business processes.

The contest is by invitation only to the top 200 contestants and top local contestants from Round 1 and contains six problems. We will also hold rated, out-of-contest participation for both div1 and div2 contestants — all three groups will feature slightly different problemsets. Local contestants will compete onsite in Silicon Valley. OpenGov, one of the featured 8 | VC companies, has been generous to host this competition at their offices; see more details about this awesome company below:

OpenGov transforms the way the world analyzes and allocates public money. With more than 700 government customers across 45 states in a rapidly expanding network, OpenGov is the market leader in cloud-based financial intelligence, budgeting, and transparency for government. The OpenGov platform transforms government financial data into intuitive, interactive visualizations for both internal government users and citizens.

ABOUT 8 | PARTNERS

8 | Partners, which consists of Joe Lonsdale (co-founder of Palantir) and his core team from Formation | 8, is a Silicon Valley venture capital firm that invests in industry-transforming technology companies. The team's investment portfolio includes companies such as those featured below, and a host of other top technology platforms that leverage modern algorithms and data science to power their core business processes. If you are interested to connect, please take a look at http://www.codeforces.com/8vc/apply.

Note that if we have exactly one card of each color, we can always make all three options (by symmetry). Thus, if we have at least one of each color, or at least two of each of two colors, we can make all three options. The remaining cases are: if we only have one color, that’s the only possible final card; if we have one of each of two colors, we can only make the third color; if we have at least two of one color and exactly one of a second, we can only make the second or third color (e.g. sample 2).

There are a variety of ways to do this problem. Here is one way: if the answer is X, there must be at least n multiples of 2 below X, at least m multiples of 3 below X, and at least n + m multiples of 2 or 3 below X. These conditions are actually sufficient, so we need to find the smallest X such that , , and . We can do this with a linear search, or with an explicit formula.

We do this algorithm in two phases: first, we compute the probability distribution of the difference between the winner and loser of each round. This takes O(n2) time. Then, we can iterate over the 2 differences which Andrew wins by and compute the probability that Jerry has a greater total using with suffix sums.

We can show that any subset with maximal simple skewness should have odd size (otherwise we drop the larger middle element: this decreases the median by more than it decreases the mean, assuming the mean is larger than the median).

Let’s fix the median at xi (in the sorted list), and set the size of the set to 2j + 1. We’d like to maximize the mean, so we can greedily choose the largest j elements below the median and the largest j elements above the median: xi - j, ..., xi - 1 and xn - j + 1, ..., xn.

Now, notice that by increasing j by 1, we add in the elements xi - j - 1 and xn - j, which decrease as j increases. Thus, for a fixed i, the overall mean is bitonic in j (it increases then decreases), so we can binary search on the marginal utility to find the optimum.

This is a dynamic programming problem. Notice that the total imbalance of the groups only depends on which students are the maximum in each group and which are the minimum in each group. We thus can think of groups as intervals bounded by the minimum and maximum student. Moreover, the total imbalance is the sum over all unit ranges of the number of intervals covering that range. We can use this formula to do our DP.

If we sort the students in increasing size, DP state is as follows: the number of students processed so far, the number of g groups which are currently “open” (have a minimum but no maximum), and the total imbalance k so far. For each student, we first add the appropriate value to the total imbalance (g times the distance to the previous student), and then either put the student in his own group (doesn’t change g), start a new group (increment g), add the student to one of the g groups (doesn’t change g), or close one of the g groups (decrement g).

First, note that the marginal utility of each additional ticket in a single raffle is decreasing. Thus, to solve the initial state, we can use a heap data structure to store the optimal raffles.

Now, after each update, we can show that the distribution should not change by much. In particular, after one ticket is added to a raffle, Johnny should either remove one ticket from that raffle and place it elsewhere, not change anything, or, if the raffle was already full, put one more ticket in to keep it full. Similarly, after a ticket is removed, Johnny should either do nothing, remove one ticket to stay under the maximum, or add one ticket. (The proofs are fairly simple and involve looking at the “cutoff” marginal utility of Johnny’s tickets.) All of these operations can be performed using two heaps storing the optimal ticket to add and the optimal ticket to remove.

The contest is for competitors in both divisions and contains seven problems. The scoring distribution is as follows:

500 — 750 — 1000 — 1500 — 2000 — 2500 — 3000

The contest will be slightly longer than usual — two and a half hours. The top 200 contestants will advance to the final round, and the top 20 local finishers will be invited to Woodside, CA to compete onsite. Good luck!

UPD: System testing is now over. Congratulations to the top contestants:

I’ve worked with Addepar and the broader 8 | family of companies in Silicon Valley throughout 2014 and 2015, and it’s been an excellent experience. I would encourage everyone in the community to learn more about the great work that these companies are doing and I’m happy to announce that 8 | Partners will be hosting the 8 | VC VentureCup on Codeforces! It’ll be a fun contest and I’ve worked on the problems along with a few competitive programmers in our network. The contest will begin on February 13 and consist of two rounds.

ABOUT 8 | PARTNERS

8 | Partners, which consists of Joe Lonsdale (co-founder of Palantir) and his core team from Formation | 8, is a Silicon Valley venture capital firm that invests in industry-transforming technology companies. The team's investment portfolio includes companies such as those featured below, and a host of other top technology platforms that leverage modern algorithms and data science to power their core business processes.

SELECT 8 | FEATURED COMPANIES

Kiwi is a San Francisco-based company making the world's dominant Q&A platform on mobile, defining a new category of interaction. We let users ask questions, publicly or anonymously, of their friends, followers, and other users all over the world. The platform empowers users to generate rich content using pictures, video, or text to express their opinions on the questions asked to them. Kiwi is creating a new type of community, built on shared curiosity from around the globe.

Radius delivers predictive marketing software that transforms the way B2B companies discover new market opportunities, acquire the right customers, and measure success. Using Radius, marketers instantly access unprecedented value with cloud-based software designed for user experience, scalability, and security for organizations of any size – from the Fortune 500 to emerging growth companies. Our software is powered by the Radius Business Graph–a proprietary data science engine fueled by intelligence on every U.S. business–which provides marketers with real-time predictive analytics, powerful segmentation, and seamless integrations to reach all their customers in more meaningful, relevant ways.

Oscar is a new kind of health insurance company, designed to put people first. Through a high-tech, data-driven approach, easy-to-understand language and a unique set of benefits, Oscar is drastically changing the way we think about and interact with our health insurance. Founded in 2012, Oscar makes health insurance simple, transparent and human.

BuildZoom is a marketplace for remodeling and construction services. We're modernizing this $1.2 trillion industry by using the world's largest collection of construction data to objectively rate and rank contractors, making it easy for homeowners, businesses and construction managers to find the best fit for any project. We then offer collaboration tools to help people manage the entire project in a simple and straight-forward manner. Since launching in 2013, BuildZoom has rapidly grown into a thriving marketplace that facilitated over $1 billion in projects in 2015.

Color's mission is to democratize access to high-quality genetic information. Color provides a high-quality, physician-ordered, genetic test at a low cost. Color's goal is to expand access to breast and ovarian cancer genetic risk information for every person, everywhere.

OpenGov transforms the way the world analyzes and allocates public money. With more than 700 government customers across 45 states in a rapidly expanding network, OpenGov is the market leader in cloud-based financial intelligence, budgeting, and transparency for government. The OpenGov platform transforms government financial data into intuitive, interactive visualizations for both internal government users and citizens.

Addepar is building a technology platform to transform the global world of finance. Addepar automates the aggregation of diverse financial datasets, and is built on a distributed calculation engine that allows advisers to perform complex, on-the-fly calculations. A best-in-class ember-based front end makes it easy to analyze complex portfolios, and a sophisticated report builder and client portal allow advisers to provide unparalleled transparency to their clients. Addepar's platform is poised to transform the financial industry by creating new standards for efficiency and transparency in portfolio analysis.

Illumio delivers adaptive security for every computing environment, protecting the 80 percent of data center and cloud traffic missed by the perimeter. The company's Adaptive Security Platform™ visualizes application traffic and delivers continuous, scalable, and dynamic policy and enforcement to every bare-metal server, VM, container, and VDI within data centers and public clouds. Using Illumio, enterprises such as Morgan Stanley, Plantronics, NTT, King Entertainment, NetSuite, and Creative Artists Agency have achieved secure application and cloud migration, environmental segmentation, compliance, and high-value application protection from breaches and threats with no changes to applications or infrastructure.

If you’re interested in job opportunities with these companies or others in the 8VC portfolio, contact us below!

THE CONTEST

The contest will occur in two rounds:

Round 1 is online and takes place on February 13. Round 1 follows regular Codeforces rules and consists of 7 problems. For this round, the complexity of the problems will be comparable to a regular Codeforces round. There are no eligibility restrictions to participate in the round.

Round 2 takes place on February 28, consists of 5 problems, and uses regular Codeforces rules. The complexity of the problems is higher than a regular Codeforces round. We will invite the top 20 local finishers in Round 1 to Woodside, CA to compete in Round 2. In addition, we will invite the top 200 overall finishers to compete online.