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. React-Native学习手册----搭建基于ios平台的开发环境

    首先推荐几个链接: React-Native 官网地址:https://facebook.github.io/react-native/docs/getting-started React-Nativ ...

  2. Python数据挖掘

    Python之所以如此流行,原因在于它的数据分析和挖掘方面表现出的高性能,而我们前面介绍的Python大都集中在各个子功能(如科学计算.矢量计算.可视化等),其目的在于引出最终的数据分析和数据挖掘功能 ...

  3. Android 系统服务的获取与创建

    在Android系统中,有一群很厉害的“家伙”,如果把Android系统比喻成一个大帮派,那么这群“家伙”的地位就像那各个分堂的堂主一样,所有的应用就像是各个小马哥,他们要做什么事情,都要堂主审批,审 ...

  4. java.sql.SQLException: The server time zone value '???ú±ê×??±??' is unrecognized or represents more than one time zone.

    [报错信息] [百度翻译] 服务器时区值'???ú±ê×??±??'无法识别或表示多个时区.如果要利用时区支持,必须配置服务器或JDBC驱动程序(通过ServerTimeZone配置属性),以使用更具 ...

  5. Android 使用TextView实现跑马灯效果

    前言 我们在开发中经常会遇到一个小问题.比如下面一个小例子: 这个文字太长,单行中导致无法全部显示出来,这就是今天要实现的功能. 当然,百度中也有很多这种解决方案. 其中有一种,例如: <Tex ...

  6. c/c++ 网络编程 read，write函数深入理解

    read,write函数深入理解 1,服务端的write函数,可以指定发送数据的长度(第三个参数length) write(connfd, &buff[i], length); 2,客户端的r ...

  7. Java Memory Management

    How Memory works in Java The role of the stack - Each time you call a function, Java pushed the loca ...

  8. NT路径，DOS路径和Device路径互相转换

    项目中遇到的比较奇葩的问题,从网上找到一份源码,https://blog.csdn.net/qq125096885/article/details/70766206 稍微整理了下,VS可以直接编译 # ...

  9. Oracle中用序列和触发器实现ID自增

    在设计数据库的时候,Oracle中没有类似SQL Server中系统自动分配ID作为主键的功能,这时Oracle可以通过“序列”和“触发器”来实现ID自动增加的功能. 1.创建序列Sequence c ...

  10. Andriod studio 打包aar

    因为项目不同,有些公用库而且还是c++的,还有一些带资源的,简单的复制遇到库升级又是一轮配置,编译成aar则解决这些麻烦. 但是默认andriod studio的make moudle只生成debug ...