A

#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 0x3f3f3f3f

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

const double EPS = 1.0e-4;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int turn[][] = {{, }, { , }, { , -}, { -, }};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

ll pre[];

int main()

{

        //freopen("out.txt","w",stdout);

        int n;

        cin >> n;

        ll sum = ;

        ll now;

        for (int i = ; i <= n; i++)

        {

                cin >> now;

                pre[i] = pre[i - ] + now;

                sum += now;

        }

        for (int i = ; i <= n; i++)

        {

                if (pre[i]*>= sum)

                {

                        cout << i << endl;

                        return ;

                }

        }

}

B

#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 0x3f3f3f3f

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

const double EPS = 1.0e-4;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int turn[][] = {{, }, { , }, { , -}, { -, }};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

int kuai[];

int pop = ;

int main()

{

        //freopen("out.txt","w",stdout);

        int n, a, b;

        cin >> n >> a >> b;

        string s;

        cin >> s;

        int len = s.size();

        int cur = ;

        for (int i = ; i <= n; i++)

        {

                if (i == n || s[i] == '*')

                {

                        kuai[++pop] = cur;

                        cur = ;

                        continue;

                }

                if (s[i] == '.')

                {

                        cur++;

                }

        }

        int anser = ;

        int jian;

        for (int i = ; i <= pop; i++)

        {

                if (kuai[i] == )

                {

                        continue;

                }

                //cout << kuai[i] << " ";

                if (kuai[i] %  == )

                {

                        anser += min(a, kuai[i] / ) + min(b, kuai[i] / );

                        a -= min(a, kuai[i] / );

                        b -= min(b, kuai[i] / );

                }

                else

                {

                        anser += min(a, kuai[i] / ) + min(b, kuai[i] / );

                        a -= min(a, kuai[i] / );

                        b -= min(b, kuai[i] / );

                        if (a >= b && a > )

                        {

                                anser++;

                                a--;

                                continue;

                        }

                        if (b >= a && b > )

                        {

                                anser++;

                                b--;

                                continue;

                        }

                }

        }

        cout << anser << endl;

}

C

#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 0x3f3f3f3f

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

const double EPS = 1.0e-4;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int turn[][] = {{, }, { , }, { , -}, { -, }};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

ll n;

ll lenn = ;

ll len = ;

ll sqr[];

int pop = ;

ll anser = ;

int aim[];

int num[];

int dfs(int x, int str)

{

        if (x == )

        {

                return ;

        }

        if (str ==  && x != )

        {

                return ;

        }

        if (x %  == str % )

        {

                return dfs(x / , str / );

        }

        else

        {

                return dfs(x, str / );

        }

}

int main()

{

        //freopen("out.txt","w",stdout);

        cin >> n;

        for (ll i = ; i <= ; i++)

        {

                if (1LL * i * i > )

                {

                        break;

                }

                else

                {

                        sqr[i] = 1LL * i * i;

                        pop++;

                }

        }

        ll cur = n;

        ll now = ;

        int flag;

        while (cur > )

        {

                num[cur % ]++;

                cur /= ;

                lenn++;

        }

        for (int i = ; i <= pop; i++)

        {

                mem(aim, );

                cur = sqr[i];

                flag = dfs(cur, n);

                if (flag)

                {

                        len = ;

                        cur = sqr[i];

                        while (cur > )

                        {

                                cur /= ;

                                len++;

                        }

                        anser = min(lenn - len,anser);

                }

        }

        if (anser == )

        {

                cout << - << endl;

        }

        else

        {

                cout << anser << endl;

        }

}

D

#include <bits/stdc++.h>

#define PI acos(-1.0)

#define mem(a,b) memset((a),b,sizeof(a))

#define TS printf("!!!\n")

#define pb push_back

#define inf 0x3f3f3f3f

//std::ios::sync_with_stdio(false);

using namespace std;

//priority_queue<int,vector<int>,greater<int>> que; get min

const double eps = 1.0e-10;

const double EPS = 1.0e-4;

typedef pair<int, int> pairint;

typedef long long ll;

typedef unsigned long long ull;

//const int maxn = 3e5 + 10;

const int turn[][] = {{, }, { , }, { , -}, { -, }};

//priority_queue<int, vector<int>, less<int>> que;

//next_permutation

ll num[];

int visit[];

int anser = ;

pair<ll, ll> cur, cnt, now;

priority_queue<pair<ll, ll>, vector<pair<ll, ll> >, greater<pair<ll, ll> > > que;

int main()

{

        //freopen("out.txt","w",stdout);

        ll n;

        cin >> n;

        for (int i = ; i <= n; i++)

        {

                scanf("%lld", &num[i]);

        }

        for (int i = ; i <= n; i++)

        {

                cur.first = num[i], cur.second = i;

                que.push(cur);

        }

        while (!que.empty())

        {

                cur = que.top();

                que.pop();

                if (que.top().first > cur.first || !que.size())

                {

                        visit[cur.second] = ;

                        num[cur.second] = cur.first;

                        continue;

                }

                cnt = que.top();

                que.pop();

                num[cnt.second] = cur.first + cnt.first;

                now.first = cur.first + cnt.first, now.second = cnt.second;

                que.push(now);

        }

        for (int i = ; i <= n; i++)

        {

                if (visit[i])

                {

                        anser++;

                }

        }

        cout << anser << endl;

        for (int i = ; i <= n; i++)

        {

                if (visit[i])

                {

                        cout << num[i] << " ";

                }

        }

        cout << endl;

}

E

#include<iostream>

#include<cstring>

#include<algorithm>

#include<queue>

#include<vector>

#include<cstdio>

#include<cmath>

#include<set>

#include<map>

#include<cstdlib>

#include<ctime>

#include<stack>

#include<bitset>

using namespace std;

#define mes(a) memset(a,0,sizeof(a))

#define rep(i,a,b) for(i = a; i <= b; i++)

#define dec(i,a,b) for(i = b; i >= a; i--)

#define fi first

#define se second

#define ls rt<<1

#define rs rt<<1|1

#define lson ls,L,mid

#define rson rs,mid+1,R

typedef double db;

typedef long long int ll;

typedef pair<int,int> pii;

typedef unsigned long long ull;

const ll inf = 1e15;

const int mx = 2e5+;

const int x_move[] = {,-,,,,,-,-};

const int y_move[] = {,,,-,,-,,-};

int main(){

    int t,q,ca = ;

    int n;

    ll pa,pb,pc;

    ll ans = ;

    pa = pb = pc = inf;

    ll pra = ,prb = ;

    scanf("%d",&n);

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

        ll v;

        char str[];

        scanf("%I64d%s",&v,str);

        if(str[]=='R'){

            if(pa!=inf){

                pra = max(pra,v-pa);

                ans += v-pa;

            }

            pa = v;

        }

        else if(str[]=='B'){

            if(pb!=inf){

                prb = max(prb,v-pb);

                ans += v-pb;

            }

            pb = v;

        }

        else{

            if(pb!=inf){

                prb = max(prb,v-pb);

                ans += v-pb;

            }

            if(pa!=inf){

                pra = max(pra,v-pa);

                ans += v-pa;

            }

            if(pc!=inf)

                ans = min(ans,ans+v-pc-pra-prb);

            pa = pb = pc = v;

            pra = prb = ;

        }

    }

    printf("%I64d\n",ans);

    return ;

}

F

因为边连通无法处理一个点同时在两个环中的情况 所以用点连通缩点 最后判一下点连通分量中是否是点的数量等于边的数量(简单环性质)

如果是的话 当前点连通分量中的边是答案的一部分

/*Huyyt*/

#include<bits/stdc++.h>

#define mem(a,b) memset(a,b,sizeof(a))

#define pb push_back

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int dir[][] = {{, }, {, }, {, -}, { -, }, {, }, {, -}, { -, -}, { -, }};

const int mod = 1e9 + ;

const int gakki =  +  +  +  + 1e9;

const int MAXN = 2e5 + ;

const int MAXM = 2e5 + ;

int to[MAXM << ], nxt[MAXM << ], Head[MAXN], tot = ;

inline void addedge(int u, int v)

{

        to[++tot] = v;

        nxt[tot] = Head[u];

        Head[u] = tot;

}

int n, m;

int dfn[MAXN], low[MAXN], dfs_clock = ;

int BCCcnt = , blong[MAXN], inque[MAXM << ];

int st[MAXN], l = , ans[MAXN], ansnum = ;

bool vis[MAXM << ];

void tarjanBCC(int x, int fa)

{

        dfn[x] = low[x] = ++dfs_clock;

        for (int i = Head[x]; i; i = nxt[i])

        {

                int v = to[i];

                if (v == fa || vis[i])

                {

                        continue;

                }

                vis[i] = vis[i ^ ] = ;

                st[l++] = i;

                if (!dfn[v])

                {

                        tarjanBCC(v, x);

                        low[x] = min(low[v], low[x]);

                        if (dfn[x] <= low[v])

                        {

                                int now, vnumber = , enumber = ;

                                BCCcnt++;

                                while()

                                {

                                        now = st[--l];

                                        if (blong[to[now]] != BCCcnt)

                                        {

                                                blong[to[now]] = BCCcnt, ++vnumber;

                                        }

                                        if (blong[to[now ^ ]] != BCCcnt)

                                        {

                                                blong[to[now ^ ]] = BCCcnt, ++vnumber;

                                        }

                                        inque[++enumber] = now;

                                        if(now==i)

                                        break;

                                }

                                if (vnumber == enumber)

                                {

                                        for (int i = ; i <= enumber; i++)

                                        {

                                                ans[++ansnum] = inque[i] / ;

                                        }

                                }

                        }

                }

                else

                {

                        low[x] = min(low[x], dfn[v]);

                }

        }

}

int main()

{

        ios_base::sync_with_stdio();

        cin.tie();

        cin >> n >> m;

        int u, v;

        for (int i = ; i <= m; i++)

        {

                cin >> u >> v;

                addedge(u, v), addedge(v, u);

        }

        for (int i = ; i <= n; i++)

        {

                if (!dfn[i])

                {

                        tarjanBCC(i, -);

                }

        }

        sort(ans + , ans +  + ansnum);

        cout << ansnum << endl;

        for (int i = ; i <= ansnum; i++)

        {

                cout << ans[i] << " ";

        }

        return ;

}

Codeforces 962 /2错误 相间位置排列 堆模拟 X轴距离最小值 前向星点双连通分量求只存在在一个简单环中的边的更多相关文章

  1. jquery.validate，错误信息位置

    好长时间没有用jquery.validate.js这个插件了,忘得差不多了.唉,好东西还是要经常拿出来看看的,今天用jquery.validate来做一个小东西,遇到一个问题,就是错误提示信息的位置问 ...

  2. justify-content 定义子元素在父元素水平位置排列的顺序

    justify-content 定义子元素在父元素水平位置排列的顺序,需要和display:flex使用才会生效. 有五个属性: 1.flex-start(默认值)  左对齐 2.flex-end 右 ...

  3. [Codeforces 1228E]Another Filling the Grid (排列组合+容斥原理)

    [Codeforces 1228E]Another Filling the Grid (排列组合+容斥原理) 题面 一个\(n \times n\)的格子,每个格子里可以填\([1,k]\)内的整数. ...

  4. [Codeforces 997C]Sky Full of Stars(排列组合+容斥原理)

    [Codeforces 997C]Sky Full of Stars(排列组合+容斥原理) 题面 用3种颜色对\(n×n\)的格子染色,问至少有一行或一列只有一种颜色的方案数.\((n≤10^6)\) ...

  5. codeforces 962F.simple cycle（tarjan/点双连通分量）

    题目连接:http://codeforces.com/contest/962/problem/F 题目大意是定义一个simple cycle为从一个节点开始绕环走一遍能经过simple cycle内任 ...

  6. C#获取网页中某个元素的位置，并模拟点击

    我们在开发中,往往要得到网页中某个元素的位置,并且点击它.要模拟一次鼠标点击并不难,只要调用一个API就行了,关键就是怎么样得到这个元素的位置,还有判断是否要滚动滚动条,要滚动多少行能让元素显示出来. ...

  7. codeforces 373 A - Efim and Strange Grade(算数模拟)

    codeforces 373 A - Efim and Strange Grade(算数模拟) 原题:Efim and Strange Grade 题意:给出一个n位的实型数,你可以选择t次在任意位进 ...

  8. [Codeforces 555E]Case of Computer Network(Tarjan求边-双连通分量+树上差分)

    [Codeforces 555E]Case of Computer Network(Tarjan求边-双连通分量+树上差分) 题面 给出一个无向图,以及q条有向路径.问是否存在一种给边定向的方案,使得 ...

  9. Codeforces 521E - Cycling City（点双连通分量+分类讨论）

    Codeforces 题面传送门 & 洛谷题面传送门 大家都是暴力找生成树然后跳路径,代码不到 50 行(暴论)的一说--好,那本蒟蒻决定提供一种代码 150 行,但复杂度也是线性的分类讨论做 ...

随机推荐

  1. 《Effective Java》读书笔记 - 5.泛型

    Chapter 5 Generics Item 23: Don't use raw types in new code 虽然你可以把一个List<String>传给一个List类型(raw ...

  2. 洛谷P1198 [JSOI2008]最大数（单点修改，区间查询）

    洛谷P1198 [JSOI2008]最大数 简单的线段树单点问题. 问题:读入A和Q时,按照读入一个字符会MLE,换成读入字符串就可以了. #include<bits/stdc++.h> ...

  3. C语言：结构体中（.）和（->）的区别

    https://blog.csdn.net/faihung/article/details/79190039 这虽然是个小问题,但有时候很容易让人迷惑,因为有的时候用混淆了,程序编译不通过. 下面说说 ...

  4. Win7下使用TortoiseGit设置保存密码

    1. 打开 TortoiseGit 设置,编辑 .gitconfig 文件,如图: 2. 添加下面两行配置,如图: [credential] helper = store 3. 保存退出即可

  5. C# Setting.settings . 用法

    1.定义 在Settings.settings文件中定义配置字段.把作用范围定义为:User则运行时可更改,Applicatiion则运行时不可更改.可以使用数据网格视图,很方便: 2.读取配置值 t ...

  6. cannot assign to struct field xxx in map

    golang 中对 map 类型中的 struct 赋值报错 type s struct{ name string age int}func main(){ a := map[string]s{ &q ...

  7. Mac搭建github Page的Hexo免费个人博客

    1.基础准备 github账号 安装git 安装node.js.npm 2.创建repo 3.配置SSH key 这一步并不重要,配置SSH key与否,并不影响博客的搭建和使用,只是配置了之后,更新 ...

  8. HTML5实现绘制几何图形

    HTML5新增了一个<canvas.../>属性.该元素自身并不绘制图形,只是相当于一张空画布.如果开发者需要向<canvas.../>上绘制图形则必须使用JavaScript ...

  9. TFS 删除工作区签出状态

    '//找出当前工作组未迁出的文件 delete tbl_pendingchange '

  10. RSTP基础配置

    本实验模拟公司网络场景.S3和S4是接入层交换机,负责用户的接入,S1和S2是汇聚层交换机,四台交换机组成一个环形网络.为了防止网络中出现环路,产生网络风暴,所有交换机上都需要运生成树协议.同时为了加 ...