![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
暴力
Knight.Panda
ᕕ(˵•̀෴•́˵)ᕗ上分吗
展开
-
F. Berland Beauty 暴力 dfs and similar sortings tree minmax
LINK题意:给出一棵树n个顶点,给出n-1边,然后告诉你m组数据-两个点之间的最小值,要你给出合法的n-1条边的可能取值,如果不存在输出-1考察:dfs and similar sortings tree 暴力优先考虑min比较大的边题目3s(我2.6sQAQ,赛后刚AC就被hackQAQ)ExamplesinputCopy41 23 23 421 2 5...原创 2020-02-07 23:21:32 · 221 阅读 · 0 评论 -
// 暴力啊 ~C. Anadi and Domino Codeforces Round #588 (Div. 2)
CF LINK DBQ 我丢人#include<bits/stdc++.h>using namespace std;int mp[10][10];int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { int x,y;scanf("%d%d",&x,&...原创 2019-09-25 16:52:02 · 109 阅读 · 0 评论 -
D. Marcin and Training Camp Codeforces Round #588 (Div. 2)
CodeForce ExamplesInputCopy43 2 3 62 8 5 10OutputCopy15InputCopy31 2 31 2 3OutputCopy0InputCopy101OutputCopy0NoteIn the first sample test, it’s optimal to send the first, th...原创 2019-09-26 16:20:44 · 184 阅读 · 0 评论