模拟-Team

#include<stdio.h>//wr
#include<string.h>
const int N=50000;
int a[N+100],c[N+100][2],book[N+100];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        memset(book,0,sizeof(book));
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++) scanf("%d%d",&c[i][0],&c[i][1]);
        for(int i=m;i>=1;i--)
        {
            if(book[i]) continue;  //只对成员操作
            if(c[i][0]==1)
            {
                if(a[c[i][1]]!=-1) a[c[i][1]]=1;
            }
            else if(c[i][0]==2)
            {
                a[c[i][1]]=-1;
            }
            else
            {
                book[c[i][1]]=1;
            }
        }
       int num=0;
       for(int i=1;i<=N;i++) if(a[i]==1) num++;
       printf("%d\n",num);
       int i;
       for(i=1;i<=N;i++){if(a[i]==1)printf("%d",i);break;}
       for(int j=i+1;j<=N;j++) {if(a[j]==1)printf(" %d",j);}printf("\n");
    }
    return 0;
}

#include<stdio.h>//记录每次操作的具体内容,无操作book-0;wr
#include<string.h>
#include<iostream>
using namespace std;
const int N=50000;
int a[N+100],book[N+100],c[N+100][2],num;
void f(int x,int y,int k)
{
         if(x==1)
         {
             if(!a[y]){a[y]=1;book[k]=1;num++;}
         }
         else
         {
             if(a[y]){a[y]=0;book[k]=1;num--;}
         }

}
int main(){
    int t;
    scanf("%d",&t);
 while(t--)
 {
     memset(a,0,sizeof(a));
     memset(book,0,sizeof(book));
     int n,m;
     scanf("%d%d",&n,&m);
     int k=1;num=0;
     while(k<=m)
     {
         int x,y;
         scanf("%d%d",&x,&y);
         if(x==1||x==2)
         {
            c[k][0]=x;c[k][1]=y;
            f(x,y,k);
         }
         else
         {
            if(!book[y]){ k++;continue;}
            if(c[y][0]==1){c[k][0]=2;c[k][1]=c[y][1];}
            else{c[k][0]=1;c[k][1]=c[y][1];}
            book[y]=0;
            f(c[k][0],c[k][1],k);
         }
         k++;
     }
     printf("%d\n",num);
     for(int i=1;i<=n;i++){if(a[i]) printf("%d",i);printf("\n");
 }
      return 0;
}

#include<stdio.h>//每个成员操作的一次性_ac
#include<string.h>
const int N=50000;
int a[N+100],c[N+100][2],book[N+100],done[N+100];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        memset(book,0,sizeof(book));
        memset(done,0,sizeof(done));
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=m;i++) scanf("%d%d",&c[i][0],&c[i][1]);
        for(int i=m;i>=1;i--)
        {
            if(book[i]) continue;
            if(c[i][0]==1)
            {
                if(!done[c[i][1]]) {done[c[i][1]]=1;a[c[i][1]]=1;}
            }
            else if(c[i][0]==2)
            {
                if(!done[c[i][1]]) {done[c[i][1]]=1;a[c[i][1]]=-1;}
            }
            else
            {
                book[c[i][1]]=1;
            }
        }
       int num=0;
       for(int i=1;i<=n;i++) if(a[i]==1) num++;
       printf("%d\n",num);
       for(int i=1;i<=n;i++){if(a[i]==1) printf("%d ",i);}
       printf("\n");
    }
    return 0;
}

点击打开链接