ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1487
. Chinese Football
decay
Transitive closure using std::bitset
// Problem
1487. Chinese Football
10 Feb 2019 20:10
Really fast.
for (int k = 0; k < n; ++k) {
for (int i = graph[k]._Find_first(); i < n; i = graph[k]._Find_next(i)) {
graph[k] |= graph[i];
}
}
© 2000–2025
Timus Online Judge Team
. All rights reserved.