xtu summer individual 2 D - Colliders

Colliders

Time Limit: 2000ms

Memory Limit: 262144KB

This problem will be judged on CodeForces. Original ID: 155D
64-bit integer IO format: %I64d      Java class name: (Any)

 

By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could cause, so the colliders were deactivated.

In 2312 there was a startling discovery: a collider's activity is safe if and only if all numbers of activated colliders are pairwise relatively prime to each other (two numbers are relatively prime if their greatest common divisor equals 1)! If two colliders with relatively nonprime numbers are activated, it will cause a global collapse.

Upon learning this, physicists rushed to turn the colliders on and off and carry out all sorts of experiments. To make sure than the scientists' quickness doesn't end with big trouble, the Large Hadron Colliders' Large Remote Control was created. You are commissioned to write the software for the remote (well, you do not expect anybody to operate it manually, do you?).

Initially, all colliders are deactivated. Your program receives multiple requests of the form "activate/deactivate the i-th collider". The program should handle requests in the order of receiving them. The program should print the processed results in the format described below.

To the request of "+ i" (that is, to activate the i-th collider), the program should print exactly one of the following responses:

• "Success" if the activation was successful.
• "Already on", if the i-th collider was already activated before the request.
• "Conflict with j", if there is a conflict with the j-th collider (that is, the j-th collider is on, and numbers i and j are not relatively prime). In this case, the i-th collider shouldn't be activated. If a conflict occurs with several colliders simultaneously, you should print the number of any of them.

The request of "- i" (that is, to deactivate the i-th collider), should receive one of the following responses from the program:

• "Success", if the deactivation was successful.
• "Already off", if the i-th collider was already deactivated before the request.

You don't need to print quotes in the output of the responses to the requests.

 

Input

The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the number of colliders and the number of requests, correspondingly.

Next m lines contain numbers of requests, one per line, in the form of either "+ i" (without the quotes) — activate the i-th collider, or "- i" (without the quotes) — deactivate the i-th collider (1 ≤ i ≤ n).

 

Output

Print m lines — the results of executing requests in the above given format. The requests should be processed in the order, in which they are given in the input. Don't forget that the responses to the requests should be printed without quotes.

 

Sample Input

10 10
+ 6
+ 10
+ 5
- 10
- 5
- 6
+ 10
+ 3
+ 6
+ 3

Output

Success
Conflict with 6
Success
Already off
Success
Success
Success
Success
Conflict with 10
Already on

Hint

Note that in the sample the colliders don't turn on after the second and ninth requests. The ninth request could also receive response "Conflict with 3".

 

Source

Codeforces Round #109 (Div. 2)

 

解题：质因数分解。任何两个互质的数，两个数的所有的素因子必定没有交集。利用这一个性质，就能判断了。

 

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <vector>
 #include <climits>
 #include <algorithm>
 #include <cmath>
 #define LL long long
 #define INF 0x3f3f3f
 using namespace std;
 const int maxn = ;
 int prime[maxn],index[maxn],tot = ;
 bool npm[maxn] = {true,true};
 bool vis[maxn];
 vector<int>pm[maxn];
 void getprime() {
     int i,j,temp;
     for(i = ; i < maxn; i++) {
         if(!npm[i]) prime[tot++] = i;
         for(j = ; j < tot && (temp = i*prime[j]) < maxn; j++) {
             npm[temp] = true;
             if(i%prime[j] == ) break;
         }
     }
     for(i = ; i < maxn; i++) {
         if(!npm[i]) pm[i].push_back(i);
         else {
             int t = sqrt(i),k = i;
             for(j = ; j < tot && prime[j] <= t; j++) {
                 if(k%prime[j] == ) {
                     pm[i].push_back(prime[j]);
                     while(k && k%prime[j] == ) k /= prime[j];
                 }
             }
             if(k > ) pm[i].push_back(k);
         }
     }
 }
 void del(int u){
     for(int i = ; i < pm[u].size(); i++)
         index[pm[u][i]] = -;
 }
 bool calc(int x,int &op) {
     int i,j;
     bool flag = true;
     for(i = ; i < pm[x].size(); i++) {
         if(index[pm[x][i]] > ) {
             flag = false;
             op = index[pm[x][i]];
             break;
         }
     }
     if(flag) {
         for(i = ; i < pm[x].size(); i++)
             index[pm[x][i]] = x;
     }
     return flag;
 }
 int main() {
     int n,m,id,i;
     char s[];
     getprime();
     while(~scanf("%d %d",&n,&m)){
         memset(vis,false,sizeof(vis));
         memset(index,-,sizeof(index));
         for(i = ; i < m; i++){
             scanf("%s %d",s,&id);
             if(id == ){
                 if(s[] == '+'){
                     if(vis[id]) puts("Already on");
                     else {vis[id] = true;puts("Success");}
                 }else{
                     if(vis[id]) {vis[id] = false;puts("Success");}
                     else puts("Already off");
                 }
             }else{
                 if(s[] == '+'){
                    if(vis[id]) puts("Already on");
                    else{
                     int conflic;
                     if(calc(id,conflic)){
                         vis[id] = true;
                         puts("Success");
                     }else printf("Conflict with %d\n",conflic);
                    }
                 }else{
                     if(vis[id]) {del(id);vis[id] = false;puts("Success");}
                     else puts("Already off");

                 }
             }
         }
     }
     return ;
 }