CF1765L.Project Manager
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
There are n employees at Bersoft company, numbered from 1 to n . Each employee works on some days of the week and rests on the other days. You are given the lists of working days of the week for each employee.
There are regular days and holidays. On regular days, only those employees work that have the current day of the week on their list. On holidays, no one works. You are provided with a list of days that are holidays. The days are numbered from 1 onwards, day 1 is Monday.
The company receives k project offers they have to complete. The projects are numbered from 1 to k in the order of decreasing priority.
Each project consists of multiple parts, where the i -th part must be completed by the ai -th employee. The parts must be completed in order (i. e. the (i+1) -st part can only be started when the i -th part is completed). Each part takes the corresponding employee a day to complete.
The projects can be worked on simultaneously. However, one employee can complete a part of only one project during a single day. If they have a choice of what project to complete a part on, they always go for the project with the highest priority (the lowest index).
For each project, output the day that project will be completed on.
输入格式
The first line contains three integers n,m and k ( 1≤n,m,k≤2⋅105 ) — the number of employees, the number of holidays and the number of projects.
The i -th of the next n lines contains the list of working days of the i -th employee. First, a single integer t ( 1≤t≤7 ) — the number of working days. Then t days of the week in the increasing order. The possible days are: "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday".
The next line contains m integers h1,h2,…,hm ( 1≤h1<h2<⋯<hm≤109 ) — the list of holidays.
The j -th of the next k lines contains a description of the j -th project. It starts with an integer p ( 1≤p≤2⋅105 ) — the number of parts in the project. Then p integers a1,a2,…,ap ( 1≤ax≤n ) follow, where pi is the index of the employee that must complete the i -th part.
The total number of parts in all projects doesn't exceed 2⋅105 .
输出格式
Print k integers — the j -th value should be equal to the day the j -th project is completed on.
输入输出样例
输入#1
3 5 4 2 Saturday Sunday 2 Tuesday Thursday 4 Monday Wednesday Friday Saturday 4 7 13 14 15 5 1 1 3 3 2 3 2 3 2 5 3 3 3 1 1 8 3 3 3 3 3 3 3 3
输出#1
25 9 27 27