[随机构造] UOJ#76. 【UR #6】智商锁

随机1000张25个点的图，two-points枚举所有情况

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#define fi first
#define se second

using namespace std;

typedef pair<int,int> pii;

const int P=998244353;

inline int Pow(int x,int y){
  int ret=1;
  for(;y;y>>=1,x=1LL*x*x%P) if(y&1) ret=1LL*ret*x%P;
  return ret;
}

struct Graph{
  int n,m,a[30][30];
  int val,e1[1010],e2[1010];

  void build(int v,int e){
    n=v;
    for(int i=2;i<=n;i++,e--){
      int x=rand()%(i-1)+1;
      a[x][x]++; a[i][i]++;
      a[i][x]--; a[x][i]--;
      e1[++m]=x; e2[m]=i;
    }
    for(int i=1;i<=e;i++){
      int x=rand()%n+1,y=rand()%n+1;
      while(x==y || a[x][y]) x=rand()%n+1,y=rand()%n+1;
      a[x][x]++; a[y][y]++;
      a[x][y]--; a[y][x]--;
      e1[++m]=x; e2[m]=y;
    }
  }

  void calc(){
    val=1;
    for(int i=1;i<n;i++){
      int k; for(k=i;!a[k][i];k++);
      if(k^1){ for(int j=1;j<n;j++) swap(a[i][j],a[k][j]); val=-val; }
      for(int j=i+1;j<n;j++){
    if(!a[j][i]) continue;
    int t=1LL*a[j][i]*Pow(a[i][i],P-2)%P;
    for(int k=i;k<n;k++)
      a[j][k]=(a[j][k]-1LL*a[i][k]*t)%P;
      }
    }
    for(int i=1;i<n;i++) val=1LL*val*a[i][i]%P;
    val=(val+P)%P;
  }

  void print(int idx){
    for(int i=1;i<=m;i++)
      printf("%d %d\n",e1[i]+idx,e2[i]+idx);
  }
}G[5010];

map<int,pii> M;

inline void print(int a,int b,int c,int d){
  int V=G[a].n+G[b].n+G[c].n+G[d].n,E=G[a].m+G[b].m+G[c].m+G[d].m;
  E+=(!!b)+(!!c)+(!!d);
  printf("%d %d\n",V,E);
  G[a].print(0);
  G[b].print(G[a].n);
  G[c].print(G[a].n+G[b].n);
  G[d].print(G[a].n+G[b].n+G[c].n);
  if(b)
    printf("%d %d\n",rand()%G[a].n+1,G[a].n+rand()%G[b].n+1);
  if(c)
    printf("%d %d\n",rand()%G[b].n+1+G[a].n,rand()%G[c].n+G[b].n+G[a].n+1);
  if(d)
    printf("%d %d\n",rand()%G[c].n+1+G[a].n+G[b].n,rand()%G[d].n+G[a].n+G[b].n+G[c].n);
}

int main(){
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
  srand(19260817);
  int t,tot=1000; scanf("%d",&t);
  for(int i=1;i<=tot;i++)
    G[i].build(25,100),G[i].calc();
  for(int i=1;i<=tot;i++)
    for(int j=i;j<=tot;j++)
      M[1LL*G[i].val*G[j].val%P]=pii(i,j);
  for(int i=1;i<=tot;i++) M[G[i].val]=pii(i,0);
  while(t--){
    int k; scanf("%d",&k);
    if(k==0){
      puts("2 0"); continue;
    }
    int a=0,b=0,c=0,d=0;
    if(M.count(k)){
      a=M[k].fi; b=M[k].se;
    }
    else{
      for(int i=1;i<=tot && !c;i++)
    for(int j=1;j<=tot;j++){
      int cur=1LL*k*Pow(1LL*G[i].val*G[j].val%P,P-2)%P;
      if(M.count(cur)){
        b=i; c=j; a=M[cur].fi; d=M[cur].se;
        break;
      }
    }
    }
    print(a,b,c,d);
  }
  return 0;
}