D. Rudolf and the Ball Game

合集 - codeforces(31)

1.B. Rudolf and 1212024-03-162.C. Rudolf and the Ugly String2024-03-163.A. Rudolf and the Ticket2024-03-16

4.D. Rudolf and the Ball Game2024-03-18

5.G. Rudolf and Subway2024-04-066.C. Choose the Different Ones!2024-02-097.B. Following the String2024-02-098.E. Klever Permutation2024-02-099.D. Find the Different Ones!2024-02-0910.B. YetnotherrokenKeoard2023-12-1011.C. Removal of Unattractive Pairs2023-12-1012.D. Jumping Through Segments2023-12-1113.E. Good Triples2023-12-1314.F. Shift and Reverse2023-12-1315.C. Nikita and LCM2024-05-2916.B. Prefiquence2024-05-0317.E. Vlad and a Pair of Numbers2024-04-0718.D. XOR Construction2024-03-2719.C. Non-coprime Split2024-01-2720.D. Divide and Equalize2024-06-0221.E. Block Sequence2024-06-0222.D. In Love2024-06-1123.C. Theofanis' Nightmare2024-06-2224.D. Yet Another Monster Fight2024-06-2225.C. Count Triangles2024-07-1126.E. Count Paths2024-07-1327.Collecting Numbers II2024-07-3128.C. Even Subarrays2024-08-0729.C. Perform Operations to Maximize Score2024-08-2030.F. Color Rows and Columns2024-08-1631.C. To Become Max2024-09-10

收起

题解：模拟+去重

每一次扔球都将所有可能性加入队列，并设为一层；然后将一层的可能性挨个出列并进行 ((qj+ri−1) mod n+1)，((qj−ri−1+n) mod n+1)操作，然后去重后入列。

code

 

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int a[N],b[1005];
int main(){
//    freopen("input.txt","r",stdin);
    int t;
    cin>>t;
    while (t--){
        int n,m,x;
        cin>>n>>m>>x;
        int r=0,l=0;
        a[r++]=x;
        for (int i=1;i<=m;i++){
            memset(b,0,sizeof(b));
            int ri,R=r;
            char c;
            cin>>ri>>c;
            while (l<R){
                int zero=(a[l]+ri-1)%n+1,one=(a[l]+n-ri-1)%n+1;
                if (c=='?') {
                    if (b[zero]==0){
                        a[r++]=zero;
                        b[zero]=1;
                    }
                    if (b[one]==0){
                        a[r++]=one;
                        b[one]=1;
                    }
                }
                if (c=='0')
                    if (b[zero]==0){
                        a[r++]=zero;
                        b[zero]=1;
                    }
                if (c=='1') 
                    if (b[one]==0){
                        a[r++]=one;
                        b[one]=1;
                    }
                l++;
            }
        }
        cout<<r-l<<endl;
        sort(a+l,a+r);
        cout<<a[l++];
        while (l<r) cout<<" "<<a[l++];
        cout<<endl;
    }
    return 0;
}