제출 #1179120

#제출 시각아이디문제언어결과실행 시간메모리
1179120stdfloat9월 (APIO24_september)C++20
55 / 100
1095 ms8284 KiB
#include <bits/stdc++.h> #include "september.h" // #include "stub.cpp" using namespace std; int solve(int n, int M, vector<int> F, vector<vector<int>> S) { vector<int> E[n]; for (int i = 1; i < n; i++) E[F[i]].push_back(i); vector<int> ind(n); for (auto i : S) { for (int j = 0; j < n - 1; j++) ind[i[j]] = max(ind[i[j]], j); } int cnt = 0, r = 0; vector<bool> vis(n); for (int i = 0; i < n - 1; i++) { for (auto j : S) { if (vis[j[i]]) continue; r = max(r, ind[j[i]]); for (auto k : E[j[i]]) r = max(r, ind[k]); } cnt += (i == r); } return cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...