2-SAT
gjghfd
这个作者很懒,什么都没留下…
展开
-
[ 前后缀优化建图 2-SAT ] Codeforces587D Duff in Mafia
题解#include<bits/stdc++.h>using namespace std;#define ll long longinline char nc(){ static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:原创 2017-10-21 07:00:14 · 487 阅读 · 0 评论 -
[ 2-SAT 线段树 ] Codeforces Gym 100159 Facebook Hacker Cup 2012 I.Unfriending
%%%Manchery题解#include<bits/stdc++.h>using namespace std;#define ll long longinline char nc(){ static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p原创 2017-10-21 09:35:23 · 315 阅读 · 0 评论 -
Codeforces Gym 101190 NEERC 2016 B. Binary Code
题解#include<bits/stdc++.h>using namespace std;#define N 500010#define M 4000000vector<char>c[N];vector<int>a[N<<1],g[M];int num,nx[N<<1][2],w[N<<1],w2[N<<1];int i,j,k,n,m,p,pos[N],pr[N<<1],sf[N<<原创 2017-10-23 19:22:36 · 712 阅读 · 0 评论