国际竞赛 | USACO竞赛零基础入门如何备考？USACO竞赛暑期培训等你

时间：2023-07-04 09:35:04 作者：犀牛教育来源：犀牛教育

在留学内卷日益严峻的今天，计算机仍旧是最为热门的专业选择之一，在申请本科大学的过程中，可以参加的国际竞赛种类数量非常多，竞赛内容也非常繁杂，那么其中最好的计算机竞赛是什么？高中生可以参加什么计算机竞赛呢？今天Sharon老师就为大家介绍下国际计算机竞赛顶流——USACO竞赛。

更多计算机竞赛课程

扫码咨询Sharon老师

TEL：16601876765

USACO

USACO竞赛简介

⭐USACO 美国计算机奥赛

USACO(United States of America Computing Olypiad)，即美国计算机奥林匹克竞赛，是针对美国中学生乃至全球学生的计算机编程在线竞赛。编程作为一门使用技能会让学理工科的学生受益终生。即便是文商科的同学，编程训练本身带来的思维优势也可以极大地促进学习。

参赛语言：C、C++、Java、Python

晋级路径：青铜级→白银级→黄金级→铂金级，难度逐级递增。新注册的参赛选手需要从最低组别开始打起。

为了便于大家理解，我们把USACO竞赛与AMC竞赛的难度做了简单的对比，参考如下👇

白金组≈AIME

黄金组≈AMC12

白银组≈AMC10

青铜组≈AMC 8

如果想要申请美国院校，USACO一定是十分适合的选择。

⭐USACO 考情解析

P1 FEB

Bessie and Elsie are plotting to overthrow Farmer John at last! They plan it out over (1 <= N <= 2 * 10 ** 5) text messages. Their conversation can be represented by a string S of length N where Is is either B or E, meaning the ith message was sent by Bessie or Elsie, respectively.

However, Farmer John hears of the plan and attempts to intercept their conversation. Thus, some letters of S are F, meaning Farmer John obfuscated the message and the sender is unknown.

The excitement level of a non-obfuscated conversation is the number of times a cow double-sends - that is, the number of occurrences of substring BB or EE in S. You want to find the excitement level of the original message, but you don’t know which of Farmer John’s messages were actually Bessie’s / Elsie’s. Over all possibilities, output all possible excitement levels of S.

INPUT FORMAT (input arrives from the terminal / stdin):

The first line will consist of one integer N.

The next line contains S

OUTPUT FORMAT (print output to the terminal / stdout):

First output K, the number of distinct excitement levels possible. On the next K lines, output the excitement levels, in increasing order.

SAMPLE INPUT:

BEEF

SAMPLE OUTPUT:

SAMPLE INPUT:

FEBFEBFEB

SAMPLE OUTPUT:

SAMPLE INPUT:

BFFFFFEBFE

SAMPLE OUTPUT:

6
SCORING:

•Inputs 4-8: N ≤ 10

•Inputs 9-20: No additional constraints.

P2 MOO LANGUAGE

Farmer John is interested in better interacting with his fellow cows, so he decided he will learn the moo language!

Moo language is actually quite similar to English, but more minimalistic. There are only four types of words: nouns, transitive verbs, intransitive verbs, and conjunctions. Every two consecutive words must be separated by a space. There are also only two types of punctuation: periods and commas. When a period or comma appears after a word, it appears directly after the word, and is then followed by a space if another word appears next.

A sentence needs to follow one of the following formats:

•Type 1: noun + intransitive verb.

•Type 2: noun + transitive verb + noun(s). Specifically, at least one noun must follow the transitive verb, and there must be a comma in front of every following noun besides the first following noun.

Two sentences may be joined into a compound sentence if a conjunction is placed in between them. The resulting compound sentence cannot be further joined with other sentences or other compound sentences. Every sentence (or compound sentence, if two sentences are joined) must end with a period.

Farmer John has a word bank of N words, C commas, and P periods (

1≤ P,C ≤N≤10 ** 3). He may only use a word or punctuation mark as many times as it appears in the word bank. Help him output a sequence of sentences containing the maximum possible number of words.

Each input file contains T (1≤T≤100) independent instances of this problem.

INPUT FORMAT (input arrives from the terminal / stdin):

The first line contains T, the number of instances. Each instance is specified as follows:

The first line consists of three integers, N, C, and P.

The N following lines will consist of two strings. The first string will be the word itself that FJ can use (a string of at least 1 and at most 10 lowercase letters), and the second string will be either one of the following: noun, transitive-verb, intransitive-verb, or conjunction, denoting the type of the word. It is possible the same word occurs more than once in FJ's word bank, but it will always have the same type each time it appears.

OUTPUT FORMAT (print output to the terminal / stdout):

In the first line, output the maximum possible number of words.

In the second line, output any sequence of sentences with the maximum possible number of words. Any valid sequence will be accepted.

The grader is sensitive to whitespace, so make sure not to output any extraneous spaces, particularly at the end of each line.

SAMPLE INPUT:

1 1 1

bessie noun

10 5 4

bessie noun

taught transitive-verb

flew intransitive-verb

elsie noun

farmer noun

john noun

and conjunction

nhoj noun

mooed intransitive-verb

24 5 4

but conjunction

bessie noun

taught transitive-verb

flew intransitive-verb

elsie noun

farmer noun

john noun

and conjunction

nhoj noun

mooed intransitive-verb

bob noun

impressed transitive-verb

cow noun

impressed transitive-verb

leaped intransitive-verb

elsie noun

bella noun

buttercup noun

pushed transitive-verb

mooed intransitive-verb

envy noun

john noun

nhoj noun

SAMPLE OUTPUT:

nhoj mooed. farmer taught elsie, bessie and john flew.

nhoj mooed. nhoj impressed john, farmer, elsie, bessie and cow impressed bob. bella pushed elsie and buttercup flew. envy mooed but john leaped.

For the first test case, the only valid sequence is the empty sequence. For each of the next two test cases, it is possible to construct a sequence of sentences using every word from the word bank except for one.

SCORING:

•Inputs 2-6: N≤10

•Inputs 7-11: N≤100

•Inputs 12-16: N≤1000

•Inputs with remainder 2 when divided by 5: There are no transitive verbs.

•Inputs with remainder 3 when divided by 5: There are no intransitive verbs.

•Inputs with remainder 4 when divided by 5: There are no conjunctions.

P3 ROTATE AND SHIFT

**Note: The time limit for this problem is 4s, 2x the default.**

To celebrate the start of spring, Farmer John's N cows (1≤N≤2⋅10**5) have invented an intriguing new dance, where they stand in a circle and re-order themselves in a predictable way.

Specifically, there are N positions around the circle, numbered sequentially from 0 to N - 1, with position 0 following position N - 1. A cow resides at each position. The cows are also numbered sequentially from 0 to N - 1.

Initially, cow i starts in position i. You are told a set of K positions 0 = A1 < A2 < … < Ak < N that are "active", meaning the cows in these positions are the next to move (1 <= K <= N).

In each minute of the dance, two things happen. First, the cows in the active positions rotate: the cow at position A1 moves to position A2, the cow at position A2 moves to position A3, and so on, with the cow at position Ak moving to position A1. All of All of these K moves happen simultaneously, so the after the rotation is complete, all of the active positions still contain exactly one cow. Next, the active positions themselves shift: A1 becomes A1 + 1, A2 becomes A2 + 1, and so on(if Ai = N -1 for some active position, then Ai circles back around to 0).

Please calculate the order of the cows after T minutes of the dance (1≤T≤10**9).

INPUT FORMAT (input arrives from the terminal / stdin):

The first line contains three integers N, K, and T.

The second line contains K integers representing the initial set of active positions A1,A2,…Ak. Recall that A1 = 0 and that these are given in increasing order.

OUTPUT FORMAT (print output to the terminal / stdout):

Output the order of the cows after T minutes, starting with the cow in position 0, separated by spaces.

SAMPLE INPUT:

5 3 4

0 2 3

SAMPLE OUTPUT:

1 2 3 4 0

For the example above, here are the cow orders and A for the first four timesteps:

Initial, T = 0: order = [0 1 2 3 4], A = [0 2 3]

T = 1: order = [3 1 0 2 4]

T = 1: A = [1 3 4]

T = 2: order = [3 4 0 1 2]

T = 2: A = [2 4 0]

T = 3: order = [2 4 3 1 0]

T = 3: A = [3 0 1]

T = 4: order = [1 2 3 4 0]

SCORING:

•Inputs 2-7: N≤1000,T≤10000

•Inputs 8-13: No additional constraints.

USACO OPEN，今年考情如何？

犀牛USACO竞赛辅导石老师认为：

本次USACO公开赛铜牌考试还是以暴力搜索和模拟为主，尤其是第二题，需要仔细审题，该题也比较有意思，结合了语言中的语法知识，很多学生很容易在这里犯懵。如果不仔细理解题意，很有可能连题都看不懂。

本次考试1，2题都有考察到字符串的知识点，如果对与字符串知识点不了解的学生就要多加小心了。

通常USACO OPEN的考试难度比一般月赛要难一些，并且考试时长为五小时（月赛为4小时），对学生来说是一大考验。

USACO

计算机竞赛意义

USACO竞赛参赛意义

USACO是美国大学申请过程中非常非常有含金量和竞争力的一个竞赛。因为大量的中国学生热衷于参加热门的美国数学奥赛、美国化学奥赛，家长学生对信奥赛认知不足，所以USACO在中国的普及度并不高。这意味着参赛选手少，赛道非常宽广。

对于USACO竞赛的课程体系，经过不断的研究，以及对于⼏百名学⽣的学习能⼒分析，犀牛计算机教师团队最终总结出了⼀套lecture + lab的课程体系⽅案。即知识点授课+ 习题课教学体系，这是⽬前很多美国主流⼤学都在⽤的教育体系，我们经过改良优化这种体系来⾼效备战USACO考试。

教学老师经验丰富

由业内多名教学专家共同组建，不乏来自加州理工大学、剑桥大学、清华大学、北京大学、复旦大学、新加坡国立大学等国际一流大学。犀牛拥有学科和竞赛专业领域内，最有经验的老师。

且90%以上名师来自全球TOP前50的世界名校，教学团队整体教学经验均2000小时以上！

针对USACO特设了暑期班和冲刺班，欢迎大家了解，可以添加Sharon老师微信X-NEW999了解详情。

更多计算机课程

扫码咨询Sharon老师

TEL：16601876765

关键字：USACO竞赛,USACO培训班,USACO竞赛辅导,

推荐资讯

国际竞赛 | USACO竞赛零基础入门如何备考？USACO竞赛暑期培训等你

国际学科

国际竞赛

语言培训