### 发生了啥

DATA这根线，在我的opamp上对应的脚名字叫做SDATA, 于是这根线也就被我叫做SDATA

Microsoft Academic Graph (MAG) is a large heterogeneous graph containing entities such as authors, papers, journals, conferences and relations between them. Microsoft provides Academic Knowledge API for this contest. The Entity attributes are defined here.

m\\$搞了一套学术数据库的API的理论呀.

Participants are supposed to provide a REST service endpoint that can find all the 1-hop, 2-hop, and 3-hop graph paths connecting a given pair of entity identifiers in MAG. The given pair of entity identifiers could be [Id, Id], [Id, AA.AuId], [AA.AuId, Id], [AA.AuId, AA.AuId]. Each node of a path should be one of the following identifiers: Id, F.Fid, J.JId, C.CId, AA.AuId, AA.AfId. Possible edges (a pair of adjacent nodes) of a path are:

• Id1 -> Id2 当且仅当它们的Rid相等呀
• Id1 -> F.Fid2 当且仅当Id1的F.Fid等于F.Fid2呀

... 以此类推呀, 自己去看原文哒吖, 没什么翻译的必要的呀

For each test case, the REST service endpoint will receive a JSON array via HTTP with a pair of entity identifiers, where the identifiers are 64-bit integers, e.g. [123, 456]. The service endpoint needs to respond with a JSON array within 300 seconds. The response JSON array consists of a list of graph paths in the form of [path1, path2, …, pathn], where each path is an array of entity identifiers. For example, if your program finds one 1-hop paths, two 2-hop paths, and one 3-hop paths, the results may look like this: [[123,456], [123,2,456], [123,3,456], [123,4,5,456]]. For a path such as [123,4,5,456], the integers are the identifiers of the entities on the path. After receiving the response, the evaluator will wait for a random period of time before sending the next requests.

The REST service must be deployed to a Standard_A3 virtual machine for the final test. There are no constraints on the programming language you can use.

The test cases are not available before the final evaluation. When the evaluation starts, the evaluator system sends test cases to the REST endpoint of each team individually. Each team will receive 10 test cases (Q1to Q10). The response time for test case Qi is recorded as Ti(1≤i≤10). The final score is calculated using:

where Ni is the size of the solution (the total number of correct paths) for Qi , Ki is the total number of paths returned by the REST service, Mi is the number of distinct correct paths returned by the REST service.

Ni是正确路径的个数，Ki是你算出路径个数，Mi是算出正确路径个数哒吖。

$P_{i,j}$表示前$i$次中取中$j$次的概率, 显然

$S_{i,j} = i! \times P_{i,j}$, 于是

## Problem A. Standing Ovation

### 翻译

$s+1$种人,从$0$编号到$s$, 编号为$i$的人鼓掌的条件是之前有$i$个人鼓掌了.

$s$种人的个数不会是$0$.

## Problem B. Infinite House of Pancakes

### 翻译

1. 让每个有任务的队列里的任务$-1$,
2. 选择其中一个队列, 把其中的任务划出一部分, 放到另外一个队列里. 这个队列可以是那$d$个队列之一, 也可以是一个新的空的队列.

## Problem C. Dijkstra

### 题解

#### $O(L^2)$

..................... ..................... ..................... .....................

..................... .......|.......|....... ..................... .....................

...............|...... ..................... ............|......... .....................