Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
ACM ICPC 2018 World Finals

我前面和你一样,无线wa。还是理解不深

Posted by liuyu523115237 at 2012-04-23 22:35:25 on Problem 1182
In Reply To:Re:几组测试数据 Posted by:08220420 at 2009-08-12 18:20:29
int find(int x) {
    int t = fa[x];
    if (fa[x] != x) {
        fa[x] = find(fa[x]);/////////////////////////////////
        flag[x] = (flag[x] + flag[t] + 1) % 3 - 1;
    }
    return fa[x];
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator