Codeforces #305 div2 E. Mike and Foam 数论 容斥原理

题目

题目链接:http://codeforces.com/problemset/problem/548/E

题目来源:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=105944#problem/N

简要题意:有一个集合,给定询问,每个询问给个位置,该位置的数在集合里就删去否则就加入,每轮求集合中互质的数对个数。

题解

维护某位置的数是否在集合中,然后维护一个数组保存集合中某数倍数的个数。

此处只需要考虑质数幂次均为一次的情况,因为这样就足够算出需要的值了。

对于每次询问先去分解素因数,更新个数的时候,对于每个素因子去二进制枚举然后更新。

更新结果的时候就去统计与该数互质的数的个数,容斥做就行了。

代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <set>
#include <map>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
// head
const int N = 2E5+5;
const int M = 5E5+5;

int a[N];
bool add[N];
int cnt[M];

vector<int> v;

void decomp(int x) {
    for (int i = 2; i*i <= x; i++) {
        if (x % i) continue;
        while (x % i == 0) x /= i;
        v.push_back(i);
    }
    if (x > 1) v.push_back(x);
}
void update(int x) {
    int mx = 1 << v.size();
    for (int i = 0; i < mx; i++) {
        int cur = 1;
        for (int j = 0; j < v.size(); j++) {
            if (i & (1<<j)) cur *= v[j];
        }
        cnt[cur] += x;
    }
}
LL query() {
    LL ans = 0;
    int mx = 1 << v.size();
    for (int i = 0; i < mx; i++) {
        int cur = 1;
        for (int j = 0; j < v.size(); j++) {
            if (i & (1<<j)) cur *= v[j];
        }
        ans += __builtin_popcount(i)&1 ? -cnt[cur] : cnt[cur];
    }
    return ans;
}
int main() {
    int n, q, x;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++) {
        scanf("%d", a+i);
    }

    LL ans = 0;
    while (q--) {
        scanf("%d", &x);
        int cur = a[x];
        v.clear();
        decomp(cur);
        if (add[x]) {
            update(-1);
            ans -= query();
        } else {
            ans += query();
            update(1);
        }
        add[x] = !add[x];
        printf("%I64d\n", ans);
    }
    return 0;
}
A children’s puzzle that was popular 30 years ago consisted of a 5&times;5 frame which contained 24 small squares of equal size. A unique letter of the alphabet was printed on each small square. Since there were only 24 squares within the frame, the frame also contained an empty position which was the same size as a small square. A square could be moved into that empty position if it were immediately to the right, to the left, above, or below the empty position. The object of the puzzle was to slide squares into the empty position so that the frame displayed the letters in alphabetical order. The illustration below represents a puzzle in its original configuration and in its configuration after the following sequence of 6 moves: 1) The square above the empty position moves. 2) The square to the right of the empty position moves. 3) The square to the right of the empty position moves. 4) The square below the empty position moves. 5) The square below the empty position moves. 6) The square to the left of the empty position moves. Write a program to display resulting frames given their initial configurations and sequences of moves. Input Input for your program consists of several puzzles. Each is described by its initial configuration and the sequence of moves on the puzzle. The first 5 lines of each puzzle description are the starting configuration. Subsequent lines give the sequence of moves. The first line of the frame display corresponds to the top line of squares in the puzzle. The other lines follow in order. The empty position in a frame is indicated by a blank. Each display line contains exactly 5 characters, beginning with the character on the leftmost square (or a blank if the leftmost square is actually the empty frame position). The display lines will correspond to a legitimate puzzle. The sequence of moves is represented by a sequence of As, Bs, Rs, and Ls to denote which square moves into the empty position. A denotes that the square above the empty position moves; B denotes that the square below the empty position moves; L denotes that the square to the left of the empty position moves; R denotes that the square to the right of the empty position moves. It is possible that there is an illegal move, even when it is represented by one of the 4 move characters. If an illegal move occurs, the puzzle is considered to have no final configuration. This sequence of moves may be spread over several lines, but it always ends in the digit 0. The end of data is denoted by the character Z. Output Output for each puzzle begins with an appropriately labeled number (Puzzle #1, Puzzle #2, etc.). If the puzzle has no final configuration, then a message to that effect should follow. Otherwise that final configuration should be displayed. Format each line for a final configuration so that there is a single blank character between two adjacent letters. Treat the empty square the same as a letter. For example, if the blank is an interior position, then it will appear as a sequence of 3 blanks — one to separate it from the square to the left, one for the empty position itself, and one to separate it from the square to the right. Separate output from different puzzle records by one blank line. Note: The first record of the sample input corresponds to the puzzle illustrated above. Sample Input TRGSJ XDOKI M VLN WPABE UQHCF ARRBBL0 ABCDE FGHIJ KLMNO PQRS TUVWX AAA LLLL0 ABCDE FGHIJ KLMNO PQRS TUVWX AAAAABBRRRLL0 Z Sample Output Puzzle #1: T R G S J X O K L I M D V B N W P A E U Q H C F Puzzle #2: A B C D F G H I E K L M N J P Q R S O T U V W X Puzzle #3: This puzzle has no final configuration. 以下是我的代码,已AC,但不知道为什么在code:blocks里总是无法正常结束,复制标准输入再到dos界面右键后最后还是有提示输入的光标,enter后才能正常结束。。。。不过中午的时候意外又可以正常结束,现在我优化了以下代码不知道为什么又不行了,跪求各位巨巨解答囧 ``` #include <stdio.h> #include <string.h> #include <ctype.h> //2.#include<stdlib.h> char str[100]; int main() { // freopen("C:\\Users\\Aliez\\Desktop\\input.txt","r",stdin); // freopen("C:\\Users\\Aliez\\Desktop\\output.txt","w",stdout); char puz[5][5],temp; int ch,c,len,m,n,T = 0,real,k; while(1){ real = 1; k = 0; memset(str,&#39;\0&#39;,sizeof(str)); memset(puz,&#39; &#39;,sizeof(puz)); for(int i = 0;i < 5;i++){ gets(puz[i]); if(puz[0][0] == &#39;Z&#39;) return 0; //1.break; //2.exit(0); if(puz[i][4] == &#39;\0&#39;) puz[i][4] = &#39; &#39;; } /*1.if(puz[0][0] == &#39;Z&#39;) break;*/ for(int i = 0;i < 5;i++){ for(int j = 0;j < 5;j++){ if(puz[i][j] == &#39; &#39;){ m = i; n = j; } } } while((c = getchar())!=&#39;0&#39;){ if(!isspace(c)) str[k++] = c; } while(1){ c = getchar(); if(isspace(c)) break; } //以下注释部分为测试代码 // puts(puz[0]); // puts(str); // printf("m=%d,n=%d\n",m,n); len = strlen(str); int x = m, y = n; for(int i = 0; i < len;i++){ switch(str[i]) { case &#39;A&#39;: x--; break; case &#39;B&#39;: x++; break; case &#39;L&#39;: y--; break; case &#39;R&#39;: y++; break; default: real = 0; break; } if(x < 0||x >4||y < 0||y > 4){ real = 0; break; } else{ puz[m][n] = puz[x][y]; puz[x][y] = &#39; &#39;; m = x; n = y; } } if(T++) printf("\n"); printf("Puzzle #%d:\n",T); if(real){ for(int i = 0;i < 5;i++){ printf("%c",puz[i][0]); for(int j = 1;j < 5;j++) printf(" %c",puz[i][j]); printf("\n"); } } else printf("This puzzle has no final configuration.\n"); } return 0; } ``` 下图是enter之前 ![图片说明](https://img-ask.csdn.net/upload/201603/31/1459420241_581438.png) 下图是enter之后 ![图片说明](https://img-ask.csdn.net/upload/201603/31/1459420264_889548.png)
©️2020 CSDN 皮肤主题: 技术黑板 设计师:CSDN官方博客 返回首页