23:I[344796,["/_next/static/chunks/083cs_iw_ie0y.js","/_next/static/chunks/2sk2f47durg8o.js","/_next/static/chunks/00mfjk9z2ewie.js","/_next/static/chunks/0ynk8uq7fqs0l.js","/_next/static/chunks/0uf80u9-0x190.js","/_next/static/chunks/0fxdv63hya-rx.js","/_next/static/chunks/2qcnia-og0qh0.js","/_next/static/chunks/10fiiv3_svxbv.js"],"default"] 2d:I[27201,["/_next/static/chunks/083cs_iw_ie0y.js","/_next/static/chunks/2sk2f47durg8o.js","/_next/static/chunks/00mfjk9z2ewie.js","/_next/static/chunks/0ynk8uq7fqs0l.js","/_next/static/chunks/0uf80u9-0x190.js","/_next/static/chunks/0fxdv63hya-rx.js","/_next/static/chunks/2qcnia-og0qh0.js"],"IconMark"] 24:T2d9d,

A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, doctor assessment records, triage records, and bed allocation logs. Your task is to compute a bed allocation risk score for each patient and print those whose risk level is HIGH or MEDIUM and who do not already have a bed.

The risk score is derived from the patient's waiting time, latest triage severity and vital status, latest doctor priority, the patient's department pressure and criticality, and the patient's age.

Read input from STDIN and write output to STDOUT. Do not print any extra debug text, as it will be treated as part of the answer and cause the test cases to fail.

Data Structures

Patients Table — each row has the fields:

patientId — unique identifier of the patient
patientName — name of the patient
departmentId — department requested for bed allocation
arrivalDay — day on which the patient arrived in the emergency department
age — age of the patient

Departments Table — each row has the fields:

departmentId — unique identifier of the department
departmentName — name of the department
totalBeds — total available beds in the department
criticalCareFlag — YES if the department is a critical-care department, otherwise NO

Triage Records Table — each row has the fields:

triageId — unique identifier of the triage record
patientId — patient for whom triage was recorded
triageDay — day on which triage was recorded
severity — one of LOW, MEDIUM, HIGH, CRITICAL
vitalStatus — STABLE or UNSTABLE

Doctor Assessments Table — each row has the fields:

assessmentId — unique identifier of the doctor assessment
patientId — patient for whom the assessment was recorded
assessmentDay — day on which the assessment was recorded
doctorPriority — one of NORMAL, URGENT, IMMEDIATE

Bed Allocation Logs Table — each row has the fields:

allocationId — unique identifier of the allocation log
patientId — patient for whom allocation was recorded
allocationDay — day on which allocation was recorded
allocationStatus — ALLOCATED or CANCELLED

Valid Record Rules

The value referenceDay is given as the first line of input and represents "today".

A triage record is valid only when all of the following hold:

1. its patientId exists in the Patients table, 2. its triageDay is between the patient's arrivalDay and referenceDay, inclusive, 3. its severity is one of LOW, MEDIUM, HIGH, CRITICAL, and 4. its vitalStatus is STABLE or UNSTABLE.

A doctor assessment record is valid only when all of the following hold:

1. its patientId exists in the Patients table, 2. its assessmentDay is between the patient's arrivalDay and referenceDay, inclusive, and 3. its doctorPriority is one of NORMAL, URGENT, IMMEDIATE.

A bed allocation log is valid only when all of the following hold:

1. its patientId exists in the Patients table, 2. its allocationDay is between the patient's arrivalDay and referenceDay, inclusive, and 3. its allocationStatus is ALLOCATED or CANCELLED.

Invalid records must be ignored completely. If multiple valid triage records exist for a patient, use the latest valid triage record (the one with the greatest triageDay; if several share that day, use the one that appears last in the input). The same rule applies to doctor assessment records using assessmentDay.

Each input record is processed independently. The identifiers in the Patients and Departments tables are guaranteed to be unique, and every departmentId in the Patients table has exactly one matching entry in the Departments table.

Features to Compute

For every patient, compute the following:

1. waitingDays = referenceDay - arrivalDay. 2. latestSeverity = the severity of the latest valid triage record; if the patient has no valid triage record, use LOW. 3. latestVitalStatus = the vitalStatus of the same latest valid triage record; if none, use STABLE. 4. latestDoctorPriority = the doctorPriority of the latest valid doctor assessment record; if none, use NORMAL. 5. isBedAllocated = true if the patient has at least one valid bed allocation log whose status is ALLOCATED. 6. departmentPendingCount = the number of patients in the same department who do not have a valid ALLOCATED bed allocation log (this count includes the patient themselves when they are not allocated).

Bed Allocation Risk Score

Compute the risk score only for patients who are not bed-allocated (isBedAllocated is false). Start the score at 0 and add points for every condition that holds. Conditions are cumulative — a patient who has waited 8 days gains points for both waitingDays >= 3 and waitingDays >= 7.

waitingDays >= 3: add 3
waitingDays >= 7: add 3
latestSeverity is HIGH: add 3
latestSeverity is CRITICAL: add 5
latestVitalStatus is UNSTABLE: add 4
latestDoctorPriority is URGENT: add 2
latestDoctorPriority is IMMEDIATE: add 4
departmentPendingCount > totalBeds: add 3
the department's criticalCareFlag is YES: add 2
age >= 65: add 2

Map the score to a risk level:

12 or more → HIGH
7 to 11 (inclusive) → MEDIUM
less than 7 → LOW

Output

Only patients who are not bed-allocated and whose risk level is HIGH or MEDIUM are printed. Print each such patient in the format:

patientName-riskLevel-riskScore-waitingDays

If more than one patient qualifies, separate them with a # character. Sort the qualifying patients using the following ordering, applying each condition only to break ties left unresolved by the previous ones:

1. HIGH risk patients before MEDIUM risk patients, 2. higher riskScore first, 3. higher waitingDays first, 4. original order of the patients in the Patients table.

If no patient qualifies, print N/A.

Input Format

The first line contains an integer referenceDay.
The second line contains the number of records in the Patients table.
The third line contains the number of records in the Departments table.
The fourth line contains the number of records in the Triage Records table.
The fifth line contains the number of records in the Doctor Assessments table.
The sixth line contains the number of records in the Bed Allocation Logs table.

The records then follow in this order, one per line:

1. Patients table: patientId patientName departmentId arrivalDay age 2. Departments table: departmentId departmentName totalBeds criticalCareFlag 3. Triage Records table: triageId patientId triageDay severity vitalStatus 4. Doctor Assessments table: assessmentId patientId assessmentDay doctorPriority 5. Bed Allocation Logs table: allocationId patientId allocationDay allocationStatus

All identifiers, names, department names, severity values, vital-status values, doctor-priority values, and allocation-status values contain no spaces.

Constraints

2 <= numberOfPatients <= 100000
1 <= numberOfDepartments <= 100000
0 <= numberOfTriageRecords <= 200000
0 <= numberOfDoctorAssessments <= 200000
0 <= numberOfBedAllocationLogs <= 200000
1 <= referenceDay <= 1000000
1 <= arrivalDay <= referenceDay
1 <= triageDay, assessmentDay, allocationDay <= 1000000
0 <= age <= 120
0 <= totalBeds <= 100000

Example

Input

20
4
2
3
3
1
P1 Arun D1 10 70
P2 Bina D1 15 30
P3 Chitra D2 18 40
P4 Dev D2 19 25
D1 ICU 1 YES
D2 General 2 NO
T1 P1 11 HIGH UNSTABLE
T2 P2 16 MEDIUM STABLE
T3 P3 19 LOW STABLE
A1 P1 12 IMMEDIATE
A2 P2 16 URGENT
A3 P3 18 NORMAL
B1 P4 19 ALLOCATED

Output

Arun-HIGH-24-10#Bina-MEDIUM-10-5

Explanation

Department D1 (ICU) has 1 bed; both of its patients (Arun and Bina) lack a valid ALLOCATED log, so departmentPendingCount = 2 > 1 — the department is under pressure — and its criticalCareFlag is YES.

Arun: waitingDays = 10 (+3 +3), latestSeverity = HIGH (+3), latestVitalStatus = UNSTABLE (+4), latestDoctorPriority = IMMEDIATE (+4), department pressure (+3), critical-care department (+2), age = 70 >= 65 (+2). Total = 24 → HIGH.
Bina: waitingDays = 5 (+3), latestDoctorPriority = URGENT (+2), department pressure (+3), critical-care department (+2). Total = 10 → MEDIUM.
Chitra: score 0 → LOW, so she is not printed.
Dev has a valid ALLOCATED bed log, so he is excluded before scoring.

Arun (HIGH) is listed before Bina (MEDIUM).

25:T1357,#include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long referenceDay; int nP, nD, nT, nA, nB; if (!(cin >> referenceDay)) return 0; cin >> nP >> nD >> nT >> nA >> nB; vector pid(nP), pname(nP), pdept(nP); vector parr(nP); vector page(nP); unordered_map pidx; pidx.reserve(nP * 2); for (int i = 0; i < nP; i++) { cin >> pid[i] >> pname[i] >> pdept[i] >> parr[i] >> page[i]; pidx[pid[i]] = i; } unordered_map dtb; unordered_map dflag; for (int i = 0; i < nD; i++) { string did, dn, fl; long long tb; cin >> did >> dn >> tb >> fl; dtb[did] = tb; dflag[did] = fl; } // latest valid triage per patient: track (day, order) best vector bestTday(nP, LLONG_MIN); vector bestTord(nP, LLONG_MIN); vector latestSev(nP, "LOW"), latestVit(nP, "STABLE"); auto sevOk = [](const string& s) { return s == "LOW" || s == "MEDIUM" || s == "HIGH" || s == "CRITICAL"; }; for (int o = 0; o < nT; o++) { string tid, ppid, sev, vit; long long day; cin >> tid >> ppid >> day >> sev >> vit; auto it = pidx.find(ppid); if (it == pidx.end()) continue; int i = it->second; if (!(parr[i] <= day && day <= referenceDay)) continue; if (!sevOk(sev)) continue; if (!(vit == "STABLE" || vit == "UNSTABLE")) continue; if (day > bestTday[i] || (day == bestTday[i] && o > bestTord[i])) { bestTday[i] = day; bestTord[i] = o; latestSev[i] = sev; latestVit[i] = vit; } } vector bestAday(nP, LLONG_MIN); vector bestAord(nP, LLONG_MIN); vector latestPri(nP, "NORMAL"); for (int o = 0; o < nA; o++) { string aid, ppid, pri; long long day; cin >> aid >> ppid >> day >> pri; auto it = pidx.find(ppid); if (it == pidx.end()) continue; int i = it->second; if (!(parr[i] <= day && day <= referenceDay)) continue; if (!(pri == "NORMAL" || pri == "URGENT" || pri == "IMMEDIATE")) continue; if (day > bestAday[i] || (day == bestAday[i] && o > bestAord[i])) { bestAday[i] = day; bestAord[i] = o; latestPri[i] = pri; } } vector allocated(nP, 0); for (int o = 0; o < nB; o++) { string bid, ppid, st; long long day; cin >> bid >> ppid >> day >> st; auto it = pidx.find(ppid); if (it == pidx.end()) continue; int i = it->second; if (!(parr[i] <= day && day <= referenceDay)) continue; if (!(st == "ALLOCATED" || st == "CANCELLED")) continue; if (st == "ALLOCATED") allocated[i] = 1; } // departmentPendingCount unordered_map pending; pending.reserve(nD * 2); for (int i = 0; i < nP; i++) if (!allocated[i]) pending[pdept[i]] += 1; struct Row { int rank; long long score; long long wd; int order; string line; }; vector rows; for (int i = 0; i < nP; i++) { if (allocated[i]) continue; long long wd = referenceDay - parr[i]; const string& sev = latestSev[i]; const string& vit = latestVit[i]; const string& pri = latestPri[i]; const string& did = pdept[i]; long long pend = pending.count(did) ? pending[did] : 0; long long tb = dtb.count(did) ? dtb[did] : 0; long long score = 0; if (wd >= 3) score += 3; if (wd >= 7) score += 3; if (sev == "HIGH") score += 3; if (sev == "CRITICAL") score += 5; if (vit == "UNSTABLE") score += 4; if (pri == "URGENT") score += 2; if (pri == "IMMEDIATE") score += 4; if (pend > tb) score += 3; if (dflag.count(did) && dflag[did] == "YES") score += 2; if (page[i] >= 65) score += 2; string lvl; if (score >= 12) lvl = "HIGH"; else if (score >= 7) lvl = "MEDIUM"; else lvl = "LOW"; if (lvl == "HIGH" || lvl == "MEDIUM") { Row rw; rw.rank = (lvl == "HIGH") ? 0 : 1; rw.score = score; rw.wd = wd; rw.order = i; rw.line = pname[i] + "-" + lvl + "-" + to_string(score) + "-" + to_string(wd); rows.push_back(move(rw)); } } sort(rows.begin(), rows.end(), [](const Row& a, const Row& b) { if (a.rank != b.rank) return a.rank < b.rank; if (a.score != b.score) return a.score > b.score; if (a.wd != b.wd) return a.wd > b.wd; return a.order < b.order; }); if (rows.empty()) { cout << "N/A\n"; return 0; } string out; for (size_t i = 0; i < rows.size(); i++) { if (i) out += "#"; out += rows[i].line; } cout << out << "\n"; return 0; } 26:T157c,import sys def solve(reference_day, patients, departments, triage_records, doctor_assessments, bed_allocations): # patients[i] = (pid, name, dept, arrival, age) in input order # departments[i] = (did, name, total_beds, critical_flag) # triage[i] = (tid, pid, day, severity, vital) # assess[i] = (aid, pid, day, priority) # bed[i] = (bid, pid, day, status) SEV = {"LOW", "MEDIUM", "HIGH", "CRITICAL"} VIT = {"STABLE", "UNSTABLE"} PRI = {"NORMAL", "URGENT", "IMMEDIATE"} ALLOC = {"ALLOCATED", "CANCELLED"} pat_index = {} # pid -> input index p_arrival = {} # pid -> arrivalDay for idx, (pid, name, dept, arrival, age) in enumerate(patients): pat_index[pid] = idx p_arrival[pid] = arrival dept_info = {did: (tb, flag) for (did, dname, tb, flag) in departments} # latest valid triage record per patient -> (severity, vital) best_triage = {} # pid -> (day, order_idx, severity, vital) for oi, (tid, pid, day, sev, vit) in enumerate(triage_records): if pid not in pat_index: continue if not (p_arrival[pid] <= day <= reference_day): continue if sev not in SEV or vit not in VIT: continue key = (day, oi) cur = best_triage.get(pid) if cur is None or key > (cur[0], cur[1]): best_triage[pid] = (day, oi, sev, vit) best_assess = {} # pid -> (day, order_idx, priority) for oi, (aid, pid, day, pri) in enumerate(doctor_assessments): if pid not in pat_index: continue if not (p_arrival[pid] <= day <= reference_day): continue if pri not in PRI: continue key = (day, oi) cur = best_assess.get(pid) if cur is None or key > (cur[0], cur[1]): best_assess[pid] = (day, oi, pri) # valid ALLOCATED bed? is_allocated = {} # pid -> bool for (bid, pid, day, status) in bed_allocations: if pid not in pat_index: continue if not (p_arrival[pid] <= day <= reference_day): continue if status not in ALLOC: continue if status == "ALLOCATED": is_allocated[pid] = True def allocated(pid): return is_allocated.get(pid, False) # departmentPendingCount: patients in same dept without valid ALLOCATED bed pending_by_dept = {} for (pid, name, dept, arrival, age) in patients: if not allocated(pid): pending_by_dept[dept] = pending_by_dept.get(dept, 0) + 1 results = [] # (level_rank, score, waiting, input_idx, line) for idx, (pid, name, dept, arrival, age) in enumerate(patients): if allocated(pid): continue waiting = reference_day - arrival bt = best_triage.get(pid) severity = bt[2] if bt else "LOW" vital = bt[3] if bt else "STABLE" ba = best_assess.get(pid) priority = ba[2] if ba else "NORMAL" total_beds, flag = dept_info[dept] pending = pending_by_dept.get(dept, 0) score = 0 if waiting >= 3: score += 3 if waiting >= 7: score += 3 if severity == "HIGH": score += 3 if severity == "CRITICAL": score += 5 if vital == "UNSTABLE": score += 4 if priority == "URGENT": score += 2 if priority == "IMMEDIATE": score += 4 if pending > total_beds: score += 3 if flag == "YES": score += 2 if age >= 65: score += 2 if score >= 12: level = "HIGH" elif score >= 7: level = "MEDIUM" else: level = "LOW" if level in ("HIGH", "MEDIUM"): rank = 0 if level == "HIGH" else 1 line = "%s-%s-%d-%d" % (name, level, score, waiting) results.append((rank, -score, -waiting, idx, line)) results.sort(key=lambda r: (r[0], r[1], r[2], r[3])) if not results: return "N/A" return "#".join(r[4] for r in results) def main(): data = sys.stdin.read().split("\n") it = iter(data) def nextline(): return next(it) reference_day = int(nextline().strip()) nP = int(nextline().strip()) nD = int(nextline().strip()) nT = int(nextline().strip()) nA = int(nextline().strip()) nB = int(nextline().strip()) patients = [] for _ in range(nP): pid, name, dept, arrival, age = nextline().split() patients.append((pid, name, dept, int(arrival), int(age))) departments = [] for _ in range(nD): did, dname, tb, flag = nextline().split() departments.append((did, dname, int(tb), flag)) triage_records = [] for _ in range(nT): tid, pid, day, sev, vit = nextline().split() triage_records.append((tid, pid, int(day), sev, vit)) doctor_assessments = [] for _ in range(nA): aid, pid, day, pri = nextline().split() doctor_assessments.append((aid, pid, int(day), pri)) bed_allocations = [] for _ in range(nB): bid, pid, day, status = nextline().split() bed_allocations.append((bid, pid, int(day), status)) sys.stdout.write(solve(reference_day, patients, departments, triage_records, doctor_assessments, bed_allocations) + "\n") if __name__ == "__main__": main() 27:T7ef,#include using namespace std; struct Patient { string patientId, patientName, departmentId; long long arrivalDay, age; }; struct Department { string departmentId, departmentName, criticalCareFlag; long long totalBeds; }; struct Triage { string triageId, patientId, severity, vitalStatus; long long triageDay; }; struct Assessment { string assessmentId, patientId, doctorPriority; long long assessmentDay; }; struct BedLog { string allocationId, patientId, allocationStatus; long long allocationDay; }; string solve(long long referenceDay, const vector& patients, const vector& departments, const vector& triageRecords, const vector& doctorAssessments, const vector& bedAllocations) { // Write your code here return "N/A"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long referenceDay; if (!(cin >> referenceDay)) return 0; int nP, nD, nT, nA, nB; cin >> nP >> nD >> nT >> nA >> nB; vector patients(nP); for (auto& p : patients) cin >> p.patientId >> p.patientName >> p.departmentId >> p.arrivalDay >> p.age; vector departments(nD); for (auto& d : departments) cin >> d.departmentId >> d.departmentName >> d.totalBeds >> d.criticalCareFlag; vector triageRecords(nT); for (auto& t : triageRecords) cin >> t.triageId >> t.patientId >> t.triageDay >> t.severity >> t.vitalStatus; vector doctorAssessments(nA); for (auto& a : doctorAssessments) cin >> a.assessmentId >> a.patientId >> a.assessmentDay >> a.doctorPriority; vector bedAllocations(nB); for (auto& b : bedAllocations) cin >> b.allocationId >> b.patientId >> b.allocationDay >> b.allocationStatus; cout << solve(referenceDay, patients, departments, triageRecords, doctorAssessments, bedAllocations) << "\n"; return 0; } 28:T79c,import sys def solve(reference_day, patients, departments, triage_records, doctor_assessments, bed_allocations): # patients[i] = (patientId, patientName, departmentId, arrivalDay, age) # departments[i] = (departmentId, departmentName, totalBeds, criticalCareFlag) # triage_records[i] = (triageId, patientId, triageDay, severity, vitalStatus) # doctor_assessments[i] = (assessmentId, patientId, assessmentDay, doctorPriority) # bed_allocations[i] = (allocationId, patientId, allocationDay, allocationStatus) # Write your code here return "N/A" def main(): data = sys.stdin.read().split("\n") idx = [0] def nextline(): line = data[idx[0]] idx[0] += 1 return line reference_day = int(nextline().strip()) nP = int(nextline().strip()) nD = int(nextline().strip()) nT = int(nextline().strip()) nA = int(nextline().strip()) nB = int(nextline().strip()) patients = [] for _ in range(nP): pid, name, dept, arrival, age = nextline().split() patients.append((pid, name, dept, int(arrival), int(age))) departments = [] for _ in range(nD): did, dname, beds, flag = nextline().split() departments.append((did, dname, int(beds), flag)) triage_records = [] for _ in range(nT): tid, pid, day, sev, vit = nextline().split() triage_records.append((tid, pid, int(day), sev, vit)) doctor_assessments = [] for _ in range(nA): aid, pid, day, pri = nextline().split() doctor_assessments.append((aid, pid, int(day), pri)) bed_allocations = [] for _ in range(nB): bid, pid, day, status = nextline().split() bed_allocations.append((bid, pid, int(day), status)) print(solve(reference_day, patients, departments, triage_records, doctor_assessments, bed_allocations)) if __name__ == "__main__": main() 29:T8ae,import java.util.*; import java.io.*; public class Main { // patients[i] = {patientId, patientName, departmentId, arrivalDay, age} // departments[i] = {departmentId, departmentName, totalBeds, criticalCareFlag} // triageRecords[i] = {triageId, patientId, triageDay, severity, vitalStatus} // doctorAssessments[i] = {assessmentId, patientId, assessmentDay, doctorPriority} // bedAllocations[i] = {allocationId, patientId, allocationDay, allocationStatus} static String solve(long referenceDay, String[][] patients, String[][] departments, String[][] triageRecords, String[][] doctorAssessments, String[][] bedAllocations) { // Write your code here return "N/A"; } public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); long referenceDay = Long.parseLong(br.readLine().trim()); int nP = Integer.parseInt(br.readLine().trim()); int nD = Integer.parseInt(br.readLine().trim()); int nT = Integer.parseInt(br.readLine().trim()); int nA = Integer.parseInt(br.readLine().trim()); int nB = Integer.parseInt(br.readLine().trim()); String[][] patients = new String[nP][]; for (int i = 0; i < nP; i++) patients[i] = br.readLine().trim().split("\\s+"); String[][] departments = new String[nD][]; for (int i = 0; i < nD; i++) departments[i] = br.readLine().trim().split("\\s+"); String[][] triageRecords = new String[nT][]; for (int i = 0; i < nT; i++) triageRecords[i] = br.readLine().trim().split("\\s+"); String[][] doctorAssessments = new String[nA][]; for (int i = 0; i < nA; i++) doctorAssessments[i] = br.readLine().trim().split("\\s+"); String[][] bedAllocations = new String[nB][]; for (int i = 0; i < nB; i++) bedAllocations[i] = br.readLine().trim().split("\\s+"); System.out.println(solve(referenceDay, patients, departments, triageRecords, doctorAssessments, bedAllocations)); } } 2a:T7ef,#include using namespace std; struct Patient { string patientId, patientName, departmentId; long long arrivalDay, age; }; struct Department { string departmentId, departmentName, criticalCareFlag; long long totalBeds; }; struct Triage { string triageId, patientId, severity, vitalStatus; long long triageDay; }; struct Assessment { string assessmentId, patientId, doctorPriority; long long assessmentDay; }; struct BedLog { string allocationId, patientId, allocationStatus; long long allocationDay; }; string solve(long long referenceDay, const vector& patients, const vector& departments, const vector& triageRecords, const vector& doctorAssessments, const vector& bedAllocations) { // Write your code here return "N/A"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); long long referenceDay; if (!(cin >> referenceDay)) return 0; int nP, nD, nT, nA, nB; cin >> nP >> nD >> nT >> nA >> nB; vector patients(nP); for (auto& p : patients) cin >> p.patientId >> p.patientName >> p.departmentId >> p.arrivalDay >> p.age; vector departments(nD); for (auto& d : departments) cin >> d.departmentId >> d.departmentName >> d.totalBeds >> d.criticalCareFlag; vector triageRecords(nT); for (auto& t : triageRecords) cin >> t.triageId >> t.patientId >> t.triageDay >> t.severity >> t.vitalStatus; vector doctorAssessments(nA); for (auto& a : doctorAssessments) cin >> a.assessmentId >> a.patientId >> a.assessmentDay >> a.doctorPriority; vector bedAllocations(nB); for (auto& b : bedAllocations) cin >> b.allocationId >> b.patientId >> b.allocationDay >> b.allocationStatus; cout << solve(referenceDay, patients, departments, triageRecords, doctorAssessments, bedAllocations) << "\n"; return 0; } 2b:T226d,# Emergency Bed Allocation Risk A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, doctor assessment records, triage records, and bed allocation logs. Your task is to compute a **bed allocation risk score** for each patient and print those whose risk level is **HIGH or MEDIUM** and who do **not** already have a bed. The risk score is derived from the patient's waiting time, latest triage severity and vital status, latest doctor priority, the patient's department pressure and criticality, and the patient's age. Read input from STDIN and write output to STDOUT. Do not print any extra debug text, as it will be treated as part of the answer and cause the test cases to fail. ## Data Structures **Patients Table** — each row has the fields: - `patientId` — unique identifier of the patient - `patientName` — name of the patient - `departmentId` — department requested for bed allocation - `arrivalDay` — day on which the patient arrived in the emergency department - `age` — age of the patient **Departments Table** — each row has the fields: - `departmentId` — unique identifier of the department - `departmentName` — name of the department - `totalBeds` — total available beds in the department - `criticalCareFlag` — `YES` if the department is a critical-care department, otherwise `NO` **Triage Records Table** — each row has the fields: - `triageId` — unique identifier of the triage record - `patientId` — patient for whom triage was recorded - `triageDay` — day on which triage was recorded - `severity` — one of `LOW`, `MEDIUM`, `HIGH`, `CRITICAL` - `vitalStatus` — `STABLE` or `UNSTABLE` **Doctor Assessments Table** — each row has the fields: - `assessmentId` — unique identifier of the doctor assessment - `patientId` — patient for whom the assessment was recorded - `assessmentDay` — day on which the assessment was recorded - `doctorPriority` — one of `NORMAL`, `URGENT`, `IMMEDIATE` **Bed Allocation Logs Table** — each row has the fields: - `allocationId` — unique identifier of the allocation log - `patientId` — patient for whom allocation was recorded - `allocationDay` — day on which allocation was recorded - `allocationStatus` — `ALLOCATED` or `CANCELLED` ## Valid Record Rules The value `referenceDay` is given as the first line of input and represents "today". A **triage record** is valid only when all of the following hold: 1. its `patientId` exists in the Patients table, 2. its `triageDay` is between the patient's `arrivalDay` and `referenceDay`, inclusive, 3. its `severity` is one of `LOW`, `MEDIUM`, `HIGH`, `CRITICAL`, and 4. its `vitalStatus` is `STABLE` or `UNSTABLE`. A **doctor assessment record** is valid only when all of the following hold: 1. its `patientId` exists in the Patients table, 2. its `assessmentDay` is between the patient's `arrivalDay` and `referenceDay`, inclusive, and 3. its `doctorPriority` is one of `NORMAL`, `URGENT`, `IMMEDIATE`. A **bed allocation log** is valid only when all of the following hold: 1. its `patientId` exists in the Patients table, 2. its `allocationDay` is between the patient's `arrivalDay` and `referenceDay`, inclusive, and 3. its `allocationStatus` is `ALLOCATED` or `CANCELLED`. Invalid records must be ignored completely. If multiple valid triage records exist for a patient, use the **latest** valid triage record (the one with the greatest `triageDay`; if several share that day, use the one that appears **last** in the input). The same rule applies to doctor assessment records using `assessmentDay`. Each input record is processed independently. The identifiers in the Patients and Departments tables are guaranteed to be unique, and every `departmentId` in the Patients table has exactly one matching entry in the Departments table. ## Features to Compute For every patient, compute the following: 1. **waitingDays** = `referenceDay - arrivalDay`. 2. **latestSeverity** = the `severity` of the latest valid triage record; if the patient has no valid triage record, use `LOW`. 3. **latestVitalStatus** = the `vitalStatus` of the same latest valid triage record; if none, use `STABLE`. 4. **latestDoctorPriority** = the `doctorPriority` of the latest valid doctor assessment record; if none, use `NORMAL`. 5. **isBedAllocated** = true if the patient has at least one valid bed allocation log whose status is `ALLOCATED`. 6. **departmentPendingCount** = the number of patients in the same department who do **not** have a valid `ALLOCATED` bed allocation log (this count includes the patient themselves when they are not allocated). ## Bed Allocation Risk Score Compute the risk score **only for patients who are not bed-allocated** (`isBedAllocated` is false). Start the score at `0` and add points for every condition that holds. Conditions are cumulative — a patient who has waited 8 days gains points for both `waitingDays >= 3` and `waitingDays >= 7`. - `waitingDays >= 3`: add `3` - `waitingDays >= 7`: add `3` - `latestSeverity` is `HIGH`: add `3` - `latestSeverity` is `CRITICAL`: add `5` - `latestVitalStatus` is `UNSTABLE`: add `4` - `latestDoctorPriority` is `URGENT`: add `2` - `latestDoctorPriority` is `IMMEDIATE`: add `4` - `departmentPendingCount > totalBeds`: add `3` - the department's `criticalCareFlag` is `YES`: add `2` - `age >= 65`: add `2` Map the score to a risk level: - `12` or more → **HIGH** - `7` to `11` (inclusive) → **MEDIUM** - less than `7` → **LOW** ## Output Only patients who are not bed-allocated and whose risk level is `HIGH` or `MEDIUM` are printed. Print each such patient in the format: `patientName-riskLevel-riskScore-waitingDays` If more than one patient qualifies, separate them with a `#` character. Sort the qualifying patients using the following ordering, applying each condition only to break ties left unresolved by the previous ones: 1. `HIGH` risk patients before `MEDIUM` risk patients, 2. higher `riskScore` first, 3. higher `waitingDays` first, 4. original order of the patients in the Patients table. If no patient qualifies, print `N/A`. ## Input Format - The first line contains an integer `referenceDay`. - The second line contains the number of records in the Patients table. - The third line contains the number of records in the Departments table. - The fourth line contains the number of records in the Triage Records table. - The fifth line contains the number of records in the Doctor Assessments table. - The sixth line contains the number of records in the Bed Allocation Logs table. The records then follow in this order, one per line: 1. Patients table: `patientId patientName departmentId arrivalDay age` 2. Departments table: `departmentId departmentName totalBeds criticalCareFlag` 3. Triage Records table: `triageId patientId triageDay severity vitalStatus` 4. Doctor Assessments table: `assessmentId patientId assessmentDay doctorPriority` 5. Bed Allocation Logs table: `allocationId patientId allocationDay allocationStatus` All identifiers, names, department names, severity values, vital-status values, doctor-priority values, and allocation-status values contain no spaces. ## Constraints - `2 <= numberOfPatients <= 100000` - `1 <= numberOfDepartments <= 100000` - `0 <= numberOfTriageRecords <= 200000` - `0 <= numberOfDoctorAssessments <= 200000` - `0 <= numberOfBedAllocationLogs <= 200000` - `1 <= referenceDay <= 1000000` - `1 <= arrivalDay <= referenceDay` - `1 <= triageDay, assessmentDay, allocationDay <= 1000000` - `0 <= age <= 120` - `0 <= totalBeds <= 100000` ## Example ### Input ``` 20 4 2 3 3 1 P1 Arun D1 10 70 P2 Bina D1 15 30 P3 Chitra D2 18 40 P4 Dev D2 19 25 D1 ICU 1 YES D2 General 2 NO T1 P1 11 HIGH UNSTABLE T2 P2 16 MEDIUM STABLE T3 P3 19 LOW STABLE A1 P1 12 IMMEDIATE A2 P2 16 URGENT A3 P3 18 NORMAL B1 P4 19 ALLOCATED ``` ### Output ``` Arun-HIGH-24-10#Bina-MEDIUM-10-5 ``` ### Explanation Department `D1` (ICU) has 1 bed; both of its patients (Arun and Bina) lack a valid `ALLOCATED` log, so `departmentPendingCount = 2 > 1` — the department is under pressure — and its `criticalCareFlag` is `YES`. - **Arun**: `waitingDays = 10` (+3 +3), `latestSeverity = HIGH` (+3), `latestVitalStatus = UNSTABLE` (+4), `latestDoctorPriority = IMMEDIATE` (+4), department pressure (+3), critical-care department (+2), `age = 70 >= 65` (+2). Total `= 24` → HIGH. - **Bina**: `waitingDays = 5` (+3), `latestDoctorPriority = URGENT` (+2), department pressure (+3), critical-care department (+2). Total `= 10` → MEDIUM. - **Chitra**: score `0` → LOW, so she is not printed. - **Dev** has a valid `ALLOCATED` bed log, so he is excluded before scoring. Arun (HIGH) is listed before Bina (MEDIUM).2c:Tc14,# Emergency Bed Allocation Risk ## Overview This is a multi-table data-processing problem. Five tables describe patients, departments, and three kinds of dated event logs. For each patient we must derive a small set of features, combine them into a weighted risk score, filter, and print the qualifying patients in a specific order. There is no clever algorithm — the difficulty is in reading the contract precisely and applying every rule consistently. ## Key Insight Every event log (triage, assessment, allocation) must first pass an identical family of validity checks: the referenced `patientId` must exist, the event's day must fall within `[arrivalDay, referenceDay]` for that specific patient, and the categorical field must be one of the allowed values. Filtering out invalid rows before doing anything else keeps every later computation honest. A single validity predicate, reused across the three tables, removes most of the room for error. ## Approach Index the patients by `patientId` so each event can be attached to its patient in `O(1)`. Stream each event table once. For triage and assessments, keep only the `latest` valid record per patient, where latest means the greatest day and, on a tie, the record appearing last in the input. For bed logs, record whether any valid `ALLOCATED` log exists. Then compute `departmentPendingCount` by counting, per department, the patients that are not allocated. Finally, for every non-allocated patient, add the cumulative point values, map the total to a level, keep only `HIGH` and `MEDIUM`, sort by the four-key ordering, and join with `#`. ## Why This Works Each feature is defined independently of the others and depends only on that patient's own validated records plus one department-level aggregate, so a single pass to validate and a single pass to score suffice. The `waitingDays` thresholds are additive by design, which is why a long wait contributes to both the `>= 3` and `>= 7` rows. The sort keys are applied strictly in priority order, and using the patient's original input index as the final key makes the ordering a total order, so the result is deterministic. ## Complexity Let `P` be the number of patients and `E` the total number of event rows. Building the patient index is `O(P)`, validating and folding the events is `O(E)`, and the final scoring plus sort is `O(P log P)`. Overall `O(P log P + E)` time and `O(P)` additional space. ## Common Pitfalls - Treating `CANCELLED` (or an out-of-range `ALLOCATED`) log as if the patient had a bed — only a *valid* `ALLOCATED` log excludes a patient. - Using a global day window instead of each patient's own `arrivalDay` when validating events. - Making the `waitingDays` bands mutually exclusive instead of cumulative, so a wait of 8 days scores 3 instead of 6. - Counting `departmentPendingCount` with `>=` instead of `>` against `totalBeds`, or forgetting that the count includes the patient themselves. - Forgetting the final tie-break on original input order, which makes the output order unstable when score, level, and waiting days all match.1c:[["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"LearningResource\",\"learningResourceType\":\"Coding Question\",\"name\":\"Emergency Bed Allocation Risk\",\"description\":\"A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, doctor assessment records, triage records, and bed allocation logs. Your task is to compute a bed allocation risk score for each patient and print those whose risk level is HIGH or MEDIUM and who do not already have a bed. The risk score is derived from the patient's waiting time, latest triage severity and vital status, latest doctor\",\"educationalLevel\":\"medium\",\"about\":{\"@type\":\"Organization\",\"name\":\"Flipkart_24july\"},\"provider\":{\"@type\":\"Organization\",\"name\":\"OAHelper\",\"url\":\"https://oahelper.in\"},\"isPartOf\":{\"@type\":\"WebSite\",\"name\":\"OAHelper\",\"url\":\"https://oahelper.in\"},\"url\":\"https://oahelper.in/problems/NTI2OXww/emergency-bed-allocation-risk\"}"}}],["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https://oahelper.in/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Problems\",\"item\":\"https://oahelper.in/problems\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Emergency Bed Allocation Risk\",\"item\":\"https://oahelper.in/problems/NTI2OXww/emergency-bed-allocation-risk\"}]}"}}],["$","section",null,{"className":"sr-only","aria-hidden":"true","children":[["$","p",null,{"children":["Company: ","Flipkart_24july"]}],["$","p",null,{"children":["Difficulty: ","medium"]}],false,["$","div",null,{"children":[["$","h2",null,{"children":"Problem Statement"}],["$","p",null,{"children":"A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, doctor assessment records, triage records, and bed allocation logs. Your task is to compute a bed allocation risk score for each patient and print those whose risk level is HIGH or MEDIUM and who do not already have a bed. The risk score is derived from the patient's waiting time, latest triage severity and vital status, latest doctor priority, the patient's department pressure and criticality, and the patient's age. Read input from STDIN and write output to STDOUT. Do not print any extra debug text, as it will be treated as part of the answer and cause the test cases to fail. Data Structures Patients Table — each row has the fields: patientId — unique identifier of the patient patientName — name of the patient departmentId — department requested for bed allocation arrivalDay — day on which the patient arrived in th"}]]}],false,["$","nav",null,{"aria-label":"Related company pages","children":[["$","$Lb",null,{"href":"/company-questions/flipkart24july","children":["More ","Flipkart_24july"," OA questions"]}],["$","$Lb",null,{"href":"/interview-experiences","children":"Interview experiences"}]]}]]}],["$","$L23",null,{"id":"NTI2OXww","initialQuestion":{"id":"NTI2OXww","title":"Emergency Bed Allocation Risk","google_doc_link":null,"problem_statement":"$24","solution_cpp":"$25","solution_python":"$26","solution_java":null,"pregiven_code_cpp":"$27","pregiven_code_python":"$28","pregiven_code_java":"$29","difficulty":"medium","question_type":"coding","premium_required":0,"created_at":"2026-07-24T22:01:07.819993+00:00","updated_at":"2026-08-10T00:00:16.750013+00:00","solution_code":null,"solution":null,"pregiven_code":"$2a","input_test_case":"[\"20\\n4\\n2\\n3\\n3\\n1\\nP1 Arun D1 10 70\\nP2 Bina D1 15 30\\nP3 Chitra D2 18 40\\nP4 Dev D2 19 25\\nD1 ICU 1 YES\\nD2 General 2 NO\\nT1 P1 11 HIGH UNSTABLE\\nT2 P2 16 MEDIUM STABLE\\nT3 P3 19 LOW STABLE\\nA1 P1 12 IMMEDIATE\\nA2 P2 16 URGENT\\nA3 P3 18 NORMAL\\nB1 P4 19 ALLOCATED\\n\", \"5\\n2\\n1\\n0\\n0\\n0\\nP1 A D1 5 10\\nP2 B D1 5 10\\nD1 Dep 5 NO\\n\"]","output_test_case":"[\"Arun-HIGH-24-10#Bina-MEDIUM-10-5\", \"N/A\"]","lc_tags":"[\"Hash Table\", \"Sorting\", \"Simulation\", \"Array\", \"String\"]","visual_animation":null,"difficulty_score":45,"md_problem_statement":"$2b","unique_company_name":"flipkart","sql_solution":null,"bash_solution":null,"js_solution":null,"editorial":"$2c","hidden_test_cases_blob_count":80,"youtube_tutorial":null,"prompt_solution":null,"campus_type":null,"college_name":null,"role":null,"hidden_test_cases_ref":null,"is_mock_oa":false,"publication_status":"published","has_image":true,"company_name":"Flipkart_24july","is_first_in_company":true,"company_ref":"MTYxNnww","total_test_cases":7,"hidden_test_cases_count":5},"isQotdToday":false,"qotdReward":5}]] 1e:null 22:[["$","title","0",{"children":"Emergency Bed Allocation Risk - Flipkart_24july OA Question | OAHelper"}],["$","meta","1",{"name":"description","content":"Emergency Bed Allocation Risk (Flipkart_24july OA) - medium: A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, do…"}],["$","meta","2",{"name":"author","content":"OAHelper Team"}],["$","meta","3",{"name":"keywords","content":"Flipkart_24july OA question, Flipkart_24july online assessment, Emergency Bed Allocation Risk, medium, online assessment, coding question, OA practice, interview preparation"}],["$","meta","4",{"name":"robots","content":"index, follow"}],["$","meta","5",{"name":"googlebot","content":"index, follow, max-video-preview:-1, max-image-preview:large, max-snippet:-1"}],["$","link","6",{"rel":"canonical","href":"https://oahelper.in/problems/NTI2OXww/emergency-bed-allocation-risk"}],["$","meta","7",{"name":"google-site-verification","content":"MCxApq58khiH0y4KRigRUpoTS3ckefkhoCSHRIRLiXo"}],["$","meta","8",{"property":"og:title","content":"Emergency Bed Allocation Risk - Flipkart_24july OA Question | OAHelper"}],["$","meta","9",{"property":"og:description","content":"Emergency Bed Allocation Risk (Flipkart_24july OA) - medium: A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, do…"}],["$","meta","10",{"property":"og:url","content":"https://oahelper.in/problems/NTI2OXww/emergency-bed-allocation-risk"}],["$","meta","11",{"property":"og:site_name","content":"OAHelper"}],["$","meta","12",{"property":"og:image","content":"https://oahelper.in/campus-ceo-favicon.png?v=11"}],["$","meta","13",{"property":"og:image:width","content":"256"}],["$","meta","14",{"property":"og:image:height","content":"256"}],["$","meta","15",{"property":"og:image:alt","content":"Emergency Bed Allocation Risk - Flipkart_24july OA Question"}],["$","meta","16",{"property":"og:type","content":"website"}],["$","meta","17",{"name":"twitter:card","content":"summary_large_image"}],["$","meta","18",{"name":"twitter:title","content":"Emergency Bed Allocation Risk - Flipkart_24july OA Question | OAHelper"}],["$","meta","19",{"name":"twitter:description","content":"Emergency Bed Allocation Risk (Flipkart_24july OA) - medium: A hospital wants to identify emergency patients who are at risk of a delayed bed allocation. The hospital stores patient arrival records, department details, do…"}],["$","meta","20",{"name":"twitter:image","content":"https://oahelper.in/campus-ceo-favicon.png?v=11"}],["$","link","21",{"rel":"shortcut icon","href":"/campus-ceo-favicon.png?v=11"}],["$","link","22",{"rel":"icon","href":"/campus-ceo-favicon-128.png?v=11","sizes":"128x128","type":"image/png"}],["$","link","23",{"rel":"icon","href":"/campus-ceo-favicon.png?v=11","sizes":"256x256","type":"image/png"}],["$","link","24",{"rel":"icon","href":"/campus-ceo-favicon-512.png?v=11","sizes":"512x512","type":"image/png"}],["$","link","25",{"rel":"apple-touch-icon","href":"/campus-ceo-favicon-512.png?v=11","sizes":"180x180","type":"image/png"}],["$","$L2d","26",{}]]