ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Set intersection-随机)
来源:互联网 发布:java程序员推荐笔记本 编辑:程序博客网 时间:2024/05/16 10:49
题意:给n+1个01串,每个串长度为
保证有解,输出任意解。
随机试即可,求证明
#include <iostream>#include <cmath>#include <algorithm>#include <cstdio>#include <cstring>#include <string>#include <vector>#include <map>#include <functional>#include <cstdlib>#include <queue>#include <stack>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define ForkD(i,k,n) for(int i=n;i>=k;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=Pre[x];p;p=Next[p])#define Forpiter(x) for(int &p=iter[x];p;p=Next[p]) #define Lson (o<<1)#define Rson ((o<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (500000000000LL)#define F (100000007)#define pb push_back#define mp make_pair #define fi first#define se second#define vi vector<int> #define pi pair<int,int>#define SI(a) ((a).size())typedef long long ll;typedef unsigned long long ull;ll mul(ll a,ll b){return (a*b)%F;}ll add(ll a,ll b){return (a+b)%F;}ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}void upd(ll &a,ll b){a=(a%F+b%F)%F;}int read(){ int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();} while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();} return x*f;} #define MAXN (6000+10)int n,m;int a[MAXN][1000];char s[MAXN];int check(int i,int j) { int ans=0; Rep(k,m) ans+=__builtin_popcount(a[i][k]&a[j][k]); return ans;}int main() { n=read(); For(i,n+1) { scanf("%s",s); m=strlen(s); Rep(j,m) a[i][j]=s[j]-33; } srand(time(NULL)); while(1) { int i=rand()%(n+1)+1; int j=rand()%(n+1)+1; if (i!=j && check(i,j)>=n/2) { if (i<j) swap(i,j); cout<<i << ' '<<j<<endl; return 0; } } return 0;}
0 0
- ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Set intersection-随机)
- ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Colored path-dp)
- ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Greedy Game-贪心)
- ICPCCamp 2016 Day 7 - Moscow SU Trinity Contest(Hans Zimmer-期望)
- Cadence SPB 16. 6 安装破解步骤
- Cadence SPB 16. 6 安装步骤
- Cadence SPB 16. 6 安装破解步骤
- Cadence SPB 16. 6 安装步骤
- Cadence SPB 16. 6 安装步骤
- DB2V7 SPB环境 配置
- ICPCCamp 2016 Day 4 - SJTU Dreadnought Contest(The Road Network-区间dp)
- ICPCCamp 2016 Day 2 - ZhejiangU Contest(Easy When You Know How-并查集+rmq)
- ICPCCamp 2016 Day 8 - Makoto Soejima's Contest #4(Ropes-树的度数与方案数)
- ICPCCamp 2016 Day 8 - Makoto Soejima's Contest #4(String Modification-模拟)
- Spb软件系列及注册码
- 简评SPB的圈子功能
- Allegro SPB 应用基本流程
- Cadence SPB/OrCAD 元件库说明
- Java学习笔记
- 对android四大启动模式的理解
- Android开发优化之——对Bitmap的内存优化
- JAVA Some Simple Class And Method Use.
- 29、下拉刷新组件SwipeLayout
- ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Set intersection-随机)
- update 值从临时表取
- Effective Java: 使用静态工厂方法
- mysql远程连接数据库很慢
- 30、微信-表情相关
- UVA 1267 - Network(贪心DFS)
- 网络编程
- Android中AsyncTask的用法
- 静态工厂方法