Codeforces Round #360 (Div. 1) 题解(待续)

NP-Hard Problem

给一幅图，把点集分为两份，使每一份都是原图的顶点覆盖
判定1副图是不是二分图，这并不是np-hard

#include<bits/stdc++.h>
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 (2139062143)
#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 (100000+10)
vi edges[MAXN];
int n,m;
int col[MAXN];
bool imp=0;
void dfs(int x,int fa,int c) {
    int sz=edges[x].size();
    col[x]=c;
    Rep(i,sz) {
        if (imp) return ;
        int v=edges[x][i];
        if (col[v]==-1) dfs(v,x,c^1);
        else if (col[v]==col[x]) {
            imp=1; return ;
        }
    }
}
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);
    cin>>n>>m;
    memset(col,-1,sizeof(col));
    Rep(i,m) {
        int u=read(),v=read();
        edges[u].pb(v);
        edges[v].pb(u);
    }
    For(i,n) if (col[i]==-1) {
        dfs(i,0,0);
    }
    if (imp) cout<<"-1"<<endl; else {
        vi v[2];
        For(i,n) v[col[i]].pb(i);
        Rep(i,2) {
            int sz=v[i].size();
            printf("%d\n",sz);
            Rep(j,sz-1) printf("%d ",v[i][j]);
            printf("%d\n",v[i][sz-1]);

        }

    }




    return 0;
}

Remainders Game

已知${c_i},k,x \mod c1,x \mod c2,x \mod c3..x \mod cn$
问是否能求出x mod k

根据平常用中国剩余定理的经验
a mod t1 和 a mod t2 能确定 a mod lcm(t1,t2)
所以只要看看c的lcm是不是k的倍数就行
PS:由于k不大可以dp

#include<bits/stdc++.h>
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 (2139062143)
#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;
} 
int n;
ll k;
ll c[1000000+10];
ll gcd(ll a,ll b){if (!b) return a;return gcd(b,a%b);}  
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    cin>>n>>k;
    For(i,n) c[i]=read();
    ll p=1;
    For(i,n) c[i]=gcd(c[i],k);
    For(i,n) p=p/gcd(p,c[i])*c[i];
    if (p==k) puts("Yes"); else puts("No");

    return 0;
}

The Values You Can Make

暴力dp

#include<bits/stdc++.h>
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 (2139062143)
#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 (500+10)
bool f[MAXN][MAXN][MAXN]={0};
int n,k;
int c[MAXN];
int main()
{
//  freopen("C.in","r",stdin);
//  freopen(".out","w",stdout);
    cin>>n>>k;
    For(i,n) cin>>c[i];
    f[0][0][0]=1;
    For(i,n) {
        Rep(j,k+1) 
            Rep(l,k+1) {
                f[i][j][l]=f[i-1][j][l];
                if (j-c[i]>=0) f[i][j][l]|=f[i-1][j-c[i]][l];
                if (l-c[i]>=0) f[i][j][l]|=f[i-1][j][l-c[i]];
            }
    }
    vi ans;
    Rep(i,k+1) if (f[n][i][k-i]) ans.pb(i);
    int sz=SI(ans);
    printf("%d\n",sz);
    Rep(i,sz-1) printf("%d ",ans[i]);
    printf("%d\n",ans[sz-1]);
    return 0;
}

Dividing Kingdom II

不会做，结果暴力可以过

#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 (2139062143)
#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())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
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;}
ll gcd(ll a,ll b){if (!b) return a; return gcd(b,a%b);}
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 (2000+10)
class bingchaji
{
public:
    int father[MAXN],n;
    void mem(int _n)
    {
        n=_n;
        For(i,n) father[i]=i;
    }
    int getfather(int x)
    {
        if (father[x]==x) return x;

        return father[x]=getfather(father[x]);
    }
    void unite(int x,int y)
    {
        father[x]=getfather(father[x]);
        father[y]=getfather(father[y]);
        father[father[x]]=father[father[y]];
    }
    bool same(int x,int y)
    {
        return getfather(x)==getfather(y);
    }
}S;
int n,m,q;
vector< pair<int, pair<int, pi > >> e;
int main() {
//  freopen("main.in","r",stdin);
//  freopen("main.out","w",stdout);
    while(cin>>n>>m>>q) {
        For(i,m) {
            int u,v,w;
            cin>>u>>v>>w;
            e.pb(mp(w,mp(u,mp(v,i))));
        }
        sort(all(e));
        reverse(all(e));
        Rep(i,q) {
            bool b=0;
            int l,r;
            cin>>l>>r;
            S.mem(2*n);
            Rep(i,m) if (l<=e[i].se.se.se&&e[i].se.se.se<=r ){
                int u=e[i].se.fi, v = e[i].se.se.fi;
                if (S.same(u,v )) {
                    b=1;
                    cout<<e[i].fi<<endl;break;
                } else {
                    S.unite(u, v+n);
                    S.unite(u+n, v);
                }

            }
            if (!b) puts("-1");

        }

    }

    return 0;
}