Zjnu Stadium

Problem Description

In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a modern stadium which could hold thousands of people. The audience Seats made a circle. The total number of columns were 300 numbered 1--300, counted clockwise, we assume the number of rows were infinite.

These days, Busoniya want to hold a large-scale theatrical performance in this stadium. There will be N people go there numbered 1--N. Busoniya has Reserved several seats. To make it funny, he makes M requests for these seats: A B X, which means people numbered B must seat clockwise X distance from people numbered A. For example: A is in column 4th and X is 2, then B must in column 6th (6=4+2).

Now your task is to judge weather the request is correct or not. The rule of your judgement is easy: when a new request has conflicts against the foregoing ones then we define it as incorrect, otherwise it is correct. Please find out all the incorrect requests and count them as R.

Input

There are many test cases:

For every case:

The first line has two integer N(1<=N<=50,000), M(0<=M<=100,000),separated by a space.

Then M lines follow, each line has 3 integer A(1<=A<=N), B(1<=B<=N), X(0<=X<300) (A!=B), separated by a space.

Output

For every case:

Output R, represents the number of incorrect request.

Sample Input

      10 10 1 2 150 3 4 200 1 5 270 2 6 200 6 5 80 4 7 150 8 9 100 4 8 50 1 7 100 9 2 100 

Sample Output

      2 
Hint
 Hint: （PS： the 5th and 10th requests are incorrect） 

题目大意：

　　输入 A B X，表示 B 的权值比 A 多 X，以300为周期，求描述错误的数目

思路：

　　标准带权并查集

代码：

1 #include 
     
       2 #include 
      
        3 #include 
       
         4 #include 
        
          5 using namespace std; 6  7 const int N = 50010; 8  9 int pre[N], val[N], cnt = 0, n, m;10 11 void init(int n) { cnt = 0;    for (int i = 1; i <= n; ++i)pre[i] = i, val[i] = 0; }12 13 int find(int a) {14     if (a == pre[a])return a;15     int tmp = pre[a];16     pre[a] = find(pre[a]);17     val[a] = (val[tmp] + val[a] + 600) % 300;18     return pre[a];19 }20 21 bool merge(int dis, int a, int b) {22     int ra = find(a), rb = find(b);23     if (ra == rb)24         return (val[a] - val[b] + 600) % 300 == dis;25     pre[ra] = rb;26     val[ra] = (val[b] - val[a] + dis + 600) % 300;27     find(a);28     return true;29 }30 31 int main() {32     while (cin >> n >> m) {33         init(n);34         int a, b, x;35         for (int i = 0; i < m; ++i) {36             scanf("%d%d%d", &a, &b, &x);37             if (!merge(x, b, a))++cnt;38         }39         printf("%d\n", cnt);40     }41 }

Zjnu Stadium

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3603 Accepted Submission(s): 1368

Problem Description

Input

There are many test cases:

For every case:

The first line has two integer N(1<=N<=50,000), M(0<=M<=100,000),separated by a space.

Then M lines follow, each line has 3 integer A(1<=A<=N), B(1<=B<=N), X(0<=X<300) (A!=B), separated by a space.

Output

For every case:

Output R, represents the number of incorrect request.

Sample Input

      10 10 1 2 150 3 4 200 1 5 270 2 6 200 6 5 80 4 7 150 8 9 100 4 8 50 1 7 100 9 2 100 

Sample Output

      2 
Hint
 Hint: （PS： the 5th and 10th requests are incorrect） 

转载于:https://www.cnblogs.com/hyp1231/p/7106427.html

你可能感兴趣的文章

单个页面Request编码方式的改变，无需改动Web.config~