A.先全部化成分钟数，取平均数之后化成正常时刻。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int main(){

    int h1,m1,h2,m2;

    scanf("%d:%d %d:%d",&h1,&m1,&h2,&m2);

    int num = (h2 - h1) *  + (m2 - m1);

    num /= ; m1 += num;

    while(m1 >= ){

        h1++;

        m1 -= ;

    }

    printf("%02d:%02d",h1,m1);

    return ;

}

A

B.所有数全部对K取余之后就能知道可以匹配他的兄弟是谁了，计数直接算即可。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int a[maxn];

int num[maxn];

int main(){

    Sca2(N,K);

    for(int i = ; i <= N ; i ++){

        scanf("%d",&a[i]);

        a[i] %= K;

        num[a[i]]++;

    }

    int ans = num[] / ;

    for(int i = ; i + i <= K; i ++){

        if(i + i == K) ans += num[i] / ;

        else ans += min(num[i],num[K - i]);

    }

    Pri(ans * );

    return ;

}

B

C.一个类似简化版的尺取即可。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int a[maxn];

int main(){

    Sca(N);

    for(int i = ; i <= N ; i ++) Sca(a[i]);

    sort(a + ,a +  + N);

    int s = ,t = ;

    int ans = ;

    for(int i = ; i <= N ; i ++){

        while(t < N && a[t + ] - a[i] <= ) t++;

        ans = max(ans,t - i + );

    }

    Pri(ans);

    return ;

}

C

D.由于使每个位置取0的D有一个固定的数，map统计一下相同D的最大个数即可。

这里选择用结构体重载一下运算符处理，double 和 long double 都WA了，所以化成了分数最简比。

要注意如果要用map去重，不但要重载 == ,还有 <,最好可以每一个元素都在 < 里面讨论到，使得map排序结果可以确定

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const long double eps = 1e-;

const int maxn = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

LL a[maxn],b[maxn];

struct Node{

    LL x,y;

    Node(){}

    Node(LL x,LL y):x(x),y(y){}

    friend bool operator == (Node a,Node b){

        return a.x == b.x && a.y == b.y;

    }

    friend bool operator < (Node a,Node b){

        if(a.x == b.x) return a.y < b.y;

        return a.x < b.x;

    }

};

LL gcd(LL a,LL b){

    return !b?a:gcd(b,a % b);

}

map<Node,int>P;

int main(){

    Sca(N);

    for(int i = ; i <= N ; i ++) scanf("%lld",&a[i]);

    for(int i = ; i <= N ; i ++) scanf("%lld",&b[i]);

    int ans = ,flag = ;

    for(int i = ;i <= N ; i ++){

        if(!a[i]){

            if(!b[i]) flag++;

            continue;

        }

        Node d;

        if(!b[i]){

            d = Node(,);

        }else{

            LL g = gcd(abs(a[i]),abs(b[i]));

            int flag = ;

            if(a[i] < ) flag *= -;

            if(b[i] < ) flag *= -;

            d = Node(flag * abs(b[i]) / g,abs(a[i]) / g);

        }

        P[d]++;

        ans = max(ans,P[d]);

    }

    Pri(ans + flag);

    return ;

}

D

E.C题的扩展，dp[i][j]记录有1 ~ j之间选i只队最多可以选多少人，直接递推即可。

5000 * 5000有很大MLE的风险，但是第一层i可以直接省略掉，空间复杂度为O(n)

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int a[maxn];

int pre[maxn];

int dp[maxn];

int main(){

    Sca2(N,K);

    for(int i = ; i <= N ; i ++) Sca(a[i]);

    sort(a + ,a +  + N);

    int t = ;

    for(int i = ; i <= N; i ++){

        while(t <= N && a[t + ] - a[i] <= ){

            t++; pre[t] = i;

        }

    }

    for(int i = ; i <= K ; i ++){

        for(int j = N; j >= ; j --){

            dp[j] = max(dp[j],dp[pre[j] - ] + j - pre[j] + );

        }

        for(int j = ; j <= N ; j ++) dp[j] = max(dp[j],dp[j - ]);

    }

    Pri(dp[N]);

    return ;

}

E

F1.取ind最多的点，将所有和他相邻的点率先加入树边，然后并查集处理加入余下的树边

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

int ind[maxn];

int fa[maxn];

void init(){

    for(int i =  ; i <= N ; i ++) fa[i] = i;

}

int find(int t){

    if(t == fa[t]) return t;

    return fa[t] = find(fa[t]);

}

int Union(int a,int b){

    a = find(a); b = find(b);

    if(a == b) return ;

    fa[a] = b;

    return ;

}

PII E[maxn];

int main(){

    Sca2(N,M); init();

    for(int i = ; i <= M ; i ++){

        int u,v; Sca2(u,v);

        E[i].fi = u; E[i].se = v;

        ind[u]++; ind[v]++;

    }

    int Max = ;

    for(int i = ; i <= N ; i ++){

        if(ind[Max] < ind[i]) Max = i;

    }

    int ans = ;

    for(int i = ; i <= M ; i ++){

        if(E[i].fi == Max || E[i].se == Max){

            if(Union(E[i].fi,E[i].se)){

                ans++;

                printf("%d %d\n",E[i].fi,E[i].se);

            }

        }

    }

    for(int i = ; i <= M && ans < N - ; i ++){

        if(Union(E[i].fi,E[i].se)){

            ans++;

            printf("%d %d\n",E[i].fi,E[i].se);

        }

    }

    return ;

}

F1

F2.一开始以为点1出去的桥必须联通，其他任意，后来发现并不。

删除所有1相邻的边之后产生的连通分量，1需要有边和每一个连通分量有边，其余剩下的位置才是任意。

#include <map>

#include <set>

#include <ctime>

#include <cmath>

#include <queue>

#include <stack>

#include <vector>

#include <string>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <functional>

using namespace std;

#define For(i, x, y) for(int i=x;i<=y;i++)

#define _For(i, x, y) for(int i=x;i>=y;i--)

#define Mem(f, x) memset(f,x,sizeof(f))

#define Sca(x) scanf("%d", &x)

#define Sca2(x,y) scanf("%d%d",&x,&y)

#define Sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)

#define Scl(x) scanf("%lld",&x);

#define Pri(x) printf("%d\n", x)

#define Prl(x) printf("%lld\n",x);

#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();

#define LL long long

#define ULL unsigned long long

#define mp make_pair

#define PII pair<int,int>

#define PIL pair<int,long long>

#define PLL pair<long long,long long>

#define pb push_back

#define fi first

#define se second

typedef vector<int> VI;

int read(){int x = ,f = ;char c = getchar();while (c<'' || c>''){if (c == '-') f = -;c = getchar();}

while (c >= ''&&c <= ''){x = x *  + c - '';c = getchar();}return x*f;}

const double eps = 1e-;

const int maxn = 2e5 + ;

const int INF = 0x3f3f3f3f;

const int mod = 1e9 + ;

int N,M,K;

struct Edge{

    int to,next;

    bool cut;

}edge[maxn * ];

int head[maxn],tot;

int fa[maxn];

int sum;

void init(){

    for(int i =  ; i <= N ; i ++) head[i] = -;

    tot = ;

}

int find(int x){

    if(x == fa[x]) return x;

    return fa[x] = find(fa[x]);

}

int Union(int a,int b){

    a = find(a); b = find(b);

    if(a == b) return ;

    fa[a] = b; sum++;

    return ;

}

void add(int u,int v){

    edge[tot].to = v;

    edge[tot].next = head[u];

    edge[tot].cut = ;

    head[u] = tot++;

}

int ind[maxn];

vector<PII>ans;

int main(){

    Sca3(N,M,K); init();

    for(int i =  ; i <= N ; i ++) fa[i] = i;

    for(int i = ; i <= M ; i ++){

        int u = read(),v = read();

        add(u,v); add(v,u);

        if(u !=  && v != ) Union(u,v);

        ind[u]++; ind[v]++;

    }

    for(int j = head[]; ~j ; j = edge[j].next){

        if(Union(,edge[j].to)){

            edge[j].cut = edge[j ^ ].cut = ;

        }

    }

    sum = ;

    for(int i = ; i <= N ; i ++) fa[i] = i;

    for(int i = head[]; ~i; i = edge[i].next){

        if(edge[i].cut && Union(,edge[i].to)){

            ans.pb(mp(,edge[i].to));

            K--;

        }

    }

    for(int i = ; i <= N; i ++){

        for(int j = head[i]; ~j; j = edge[j].next){

            if((i ==  || edge[j].to == ) && K <= ) continue;

            if(Union(edge[j].to,i)){

                if(i ==  || edge[j].to == ) K--;

                ans.pb(mp(i,edge[j].to));

            }

        }

    }

    if(sum < N -  || K){

        puts("NO");

        if(M == ){

            cout << sum << " " << K << endl;

        }

        return ;

    }

    puts("YES");

    for(int i =  ; i < ans.size(); i ++){

        printf("%d %d\n",ans[i].fi,ans[i].se);

    }

    return ;

}

F2

codeforces-1133 (div3)的更多相关文章

  1. Codeforces #550 (Div3) - G.Two Merged Sequences（dp / 贪心）

    Problem  Codeforces #550 (Div3) - G.Two Merged Sequences Time Limit: 2000 mSec Problem Description T ...

  2. codeforces #579(div3)

    codeforces #579(div3) A. Circle of Students 题意: 给定一个n个学生的编号,学生编号1~n,如果他们能够在不改变顺序的情况下按编号(无论是正序还是逆序,但不 ...

  3. CodeForces 1029E div3

    题目链接 第一道场上自己做出来的E题...虽然是div3,而且是原题... 当时做完ABC,D题没有思路就去怼E了,然后发现貌似原题? 事实上就是原题... 给个原题链接... [HNOI2003]消 ...

  4. [Codeforces #615 div3]1294E Obtain a Permutation

    Before the Beginniing 本文为 Clouder 原创文章,原文链接为Click,转载时请将本段放在文章开头显眼处.如进行了二次创作,请明确标明. 由本人转载于博客园. 题意分析 C ...

  5. Codeforces #624 div3 C

    You want to perform the combo on your opponent in one popular fighting game. The combo is the string ...

  6. Codeforces 1133 F2. Spanning Tree with One Fixed Degree 并查集+生成树

    好久没更新博客了,一直懒得动,这次更新一下. 题意大概是:给出一个图,求它的一个一号节点的度数恰好为D的生成树的方案. 一开始随便水了个乱搞贪心,不出意外并没有过. 仔细思考之后,对于这个问题我们可以 ...

  7. Twist the Permutation 数列的轮换题 Codeforces 776 div3

    这是一道比较经典的将数列中的数字轮换的题目,我们先看题干: 题干分析:先浅浅地分析一下题目是要我们干什么,我们会默认有一个已经升序排序地1~n的排列,然后我们会给定一个新排列是在原有排列的基础上进行o ...

  8. 记一次神奇的codeforces

    今天有一场codeforces的div3,时间挺合适,于是就想打.结果发现rating超过1600就不能报名.虽然shzr好久不打CF了而且很菜,但是毕竟还是到了1600的,于是和ZUTTER_一起用 ...

  9. CodeForces Round #527 (Div3) B. Teams Forming

    http://codeforces.com/contest/1092/problem/B There are nn students in a university. The number of st ...

  10. 【赛时总结】◇赛时·V◇ Codeforces Round #486 Div3

    ◇赛时·V◇ Codeforces Round #486 Div3 又是一场历史悠久的比赛,老师拉着我回来考古了……为了不抢了后面一些同学的排名,我没有做A题 ◆ 题目&解析 [B题]Subs ...

随机推荐

  1. HTML页面转换为Sharepoint母版页（实战）

    分享人:广州华软 极简 一. 前言 SharePoint有母版页.布局页.母版页存放着如头部(顶部菜单.导航),底部等比较通用部分,通常网站只需一套即可:而布局页,则存放着主要内容部分,根据页面需要, ...

  2. java 线程方法 ---- wait()

    class MyThread5 implements Runnable{ private int flag = 10; @Override public void run() { while (fla ...

  3. Android Fragment碎片

    什么是碎片? 碎片(Fragment)是一种可以嵌入在活动当中的UI片段,它能让程序更加合理和充分地利用大屏幕的空间,因而在平板上应用的非常广泛.可以把Fragment当成Activity一个界面的一 ...

  4. 【English】六、am,is,are 分别用在什么地方

    is:第三人称单数am:第一人称单数are:第二人称单数,第一.二.三人称的复数 用于第一人称, I am ......(我是.......)用于第三人称, He is ......(他是...... ...

  5. cvc-elt.1: Cannot find the declaration of element 'beans'Failed to read schema document 'http://www.springframework.org/schema/beans/spring- beans-3.0.xsd'

    Multiple annotations found at this line: - cvc-elt.1: Cannot find the declaration of element 'beans' ...

  6. C# Socket网络编程

    晚上利用空闲时间,用Socket做了一些小功能. 功能如下: a.聊天 b.传文件 c.抖动好友 主界面: 服务器 客户端 操作步骤: 服务器(测试环境的IP地址为:192.168.92.111,视情 ...

  7. 根据Webservice地址，动态传入参数(Webservice代理类)

    using System; using System.Collections.Generic; using System.Linq; using System.Text; using Sunlib; ...

  8. c/c++ 继承与多态 文本查询的小例子（非智能指针版本）

    问题:在上一篇继承与多态 文本查询的小例子(智能指针版本)在Query类里使用的是智能指针,只把智能指针换成普通的指针,并不添加拷贝构造方法,会发生什么呢? 执行时,代码崩掉. 分析下面一行代码: Q ...

  9. SpringBoot开发案例之打造私有云网盘

    前言 最近在做工作流的事情,正好有个需求,要添加一个附件上传的功能,曾找过不少上传插件,都不是特别满意.无意中发现一个很好用的开源web文件管理器插件 elfinder,功能比较完善,社区也很活跃,还 ...

  10. Swing 混合布局

    案例一:Border边境边界 package swing; /** * swing 混合布局 */ import java.awt.*; import javax.swing.*; public cl ...