Contest 226 - C - Martial artist

关注

VIP免费原创最新推荐文章于 2026-07-11 09:12:59 发布 1k 阅读 AI 写同款· GEO 优化 ›

C++笔记之类模板、函数模板、可变参数模板、模板特化内容关键点函数模板编译器根据实参推导类型，推导冲突时用<>显式指定类模板每个不同的类型参数生成一个独立的类，C++17 起支持实参推导可变参数模板声明、args...展开、sizeof...计数，C++17 可用折叠表达式模板特化全特化写，偏特化只限类模板，不需要继承符号模板与继承依赖型基类要用this->或using，类型前要加typename。阅读详情

from atcoder

Problem Statement

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 300300 points

Takahashi is a martial artist. There are NN moves that a martial artist can learn, called Move 11, 22, \ldots…, NN. For each 1 \leq i \leq N1≤i≤N, it takes T_iTi minutes of practice to learn Move ii. Additionally, at the beginning of that practice, all of the Moves A_{i,1}Ai,1, A_{i,2}Ai,2, \ldots…, A_{i,K_i}Ai,Ki must be already learned. Here, it is guaranteed that A_{i,j} < iAi,j<i for each 1 \leq j \leq K_i1≤j≤Ki.

Takahashi has not learned any move at time 00. He cannot practice for more than one move simultaneously, nor can he stop a practice he has already started. Find the minimum number of minutes needed for Takahashi to learn Move NN.

Constraints