2016 ICPC 青岛 网络赛

最新推荐文章于 2021-07-13 18:28:02 发布
最新推荐文章于 2021-07-13 18:28:02 发布
阅读量689 收藏
点赞数
分类专栏： 杂题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Triose_Stream/article/details/52566473
版权

hdu 5879
http://acm.hdu.edu.cn/showproblem.php?pid=5879
Cure

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 608 Accepted Submission(s): 211

Problem Description
Given an integer n, we only want to know the sum of 1/k2 where k from 1 to n.

Input
There are multiple cases.
For each test case, there is a single line, containing a single positive integer n.
The input file is at most 1M.

Output
The required sum, rounded to the fifth digits after the decimal point.

Sample Input
1
2
4
8
15

Sample Output
1.00000
1.25000
1.42361
1.52742
1.58044

预处理头几项，后面的项直接输出预处理的最后一项（因为精度问题，后面的都是相等的）

/*
 *
 *  Author : Triose
 *  Email  : Triose@163.com
 *  Update_time : 2016.9.11
 *
 */


//#include<bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <math.h>
#include <time.h>
#include <bitset>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <iostream>
#include <string.h>
#include <iterator>
#include <stdlib.h>
#include <algorithm>
using namespace std;
//#define ONLINE_JUDGE

#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define enter putchar(10)

#define rep(i,a,b) for(int i = (a); i < (b); ++i)
#define per(i,a,b) for(int i = (a); i >= (b); --i)
#define repe(i,a,b) for(int i = (a); i <= (b); ++i)
#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)

#define PR(a,b) pair<a,b>
#define slen(str) strlen(str)
#define ds(t) int t; sf(t)
#define Down(t) while(t--)
#define dc(t) int t; cin >> t;
#define dsD(t) ds(t); Down(t)
#define dcD(t) dc(t); Down(t)
#define ALL(A) A.begin(), A.end()
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scpy(str1, str2) strcpy(str1, str2)
#define sfs(a) scanf("%s",a)
#define pf(a) printf("%d\n",a)
#define pfd(a,b) printf("%d %d\n",a,b)
#define pfP(a) printf("%d %d\n",a.fi,a.se)
#define pfs(a) printf("%s\n",a)
#define pfI(a) printf("%I64d\n",a)
#define mem(a,b) memset((a),b,sizeof(a))

#define fi first
#define se second
#define LL long long
#define DB double
#define isws ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double E = exp(1.0);

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }

int n, m;
const int maxn = 400000;
double ans[maxn];

void Init() {
    ans[1] = 1.0;
    rep(i, 2, maxn) ans[i] = ans[i - 1] + (1 / (i * 1.0 * i));
}

void print() {
    rep(i, 1, maxn) printf("%d: %lf\n", i, ans[i]);
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("Out.txt", "w", stdout);
#endif
    Init();
//    print();
    while(~sf(n)) {
        if(n >= 1 && n < maxn) printf("%.5lf\n", ans[n]);
        else printf("%.5lf\n", ans[maxn - 1]);
    }
    return 0;
}

5882
http://acm.hdu.edu.cn/showproblem.php?pid=5882
Balanced Game

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 151 Accepted Submission(s): 135

Problem Description
Rock-paper-scissors is a zero-sum hand game usually played between two people, in which each player simultaneously forms one of three shapes with an outstretched hand. These shapes are “rock”, “paper”, and “scissors”. The game has only three possible outcomes other than a tie: a player who decides to play rock will beat another player who has chosen scissors (“rock crushes scissors”) but will lose to one who has played paper (“paper covers rock”); a play of paper will lose to a play of scissors (“scissors cut paper”). If both players choose the same shape, the game is tied and is usually immediately replayed to break the tie.

Recently, there is a upgraded edition of this game: rock-paper-scissors-Spock-lizard, in which there are totally five shapes. The rule is simple: scissors cuts paper; paper covers rock; rock crushes lizard; lizard poisons Spock; Spock smashes scissors; scissors decapitates lizard; lizard eats paper; paper disproves Spock; Spock vaporizes rock; and as it always has, rock crushes scissors.

Both rock-paper-scissors and rock-paper-scissors-Spock-lizard are balanced games. Because there does not exist a strategy which is better than another. In other words, if one chooses shapes randomly, the possibility he or she wins is exactly 50% no matter how the other one plays (if there is a tie, repeat this game until someone wins). Given an integer N, representing the count of shapes in a game. You need to find out if there exist a rule to make this game balanced.

Input
The first line of input contains an integer t, the number of test cases. t test cases follow.
For each test case, there is only one line with an integer N (2≤N≤1000), as described above.

Here is the sample explanation.

In the first case, donate two shapes as A and B. There are only two kind of rules: A defeats B, or B defeats A. Obviously, in both situation, one shapes is better than another. Consequently, this game is not balanced.

In the second case, donate two shapes as A, B and C. If A defeats B, B defeats C, and C defeats A, this game is balanced. This is also the same as rock-paper-scissors.

In the third case, it is easy to set a rule according to that of rock-paper-scissors-Spock-lizard.

Output
For each test cases, output “Balanced” if there exist a rule to make the game balanced, otherwise output “Bad”.

Sample Input
3
2
3
5

Sample Output
Bad
Balanced
Balanced

输入n，如果n是奇数就输出Balanced，否则输出Bad。。。

/*
 *
 *  Author : Triose
 *  Email  : Triose@163.com
 *  Update_time : 2016.9.11
 *
 */


//#include<bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#include <math.h>
#include <time.h>
#include <bitset>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <iostream>
#include <string.h>
#include <iterator>
#include <stdlib.h>
#include <algorithm>
using namespace std;
//#define ONLINE_JUDGE

#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define enter putchar(10)

#define rep(i,a,b) for(int i = (a); i < (b); ++i)
#define per(i,a,b) for(int i = (a); i >= (b); --i)
#define repe(i,a,b) for(int i = (a); i <= (b); ++i)
#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)

#define PR(a,b) pair<a,b>
#define slen(str) strlen(str)
#define ds(t) int t; sf(t)
#define Down(t) while(t--)
#define dc(t) int t; cin >> t;
#define dsD(t) ds(t); Down(t)
#define dcD(t) dc(t); Down(t)
#define ALL(A) A.begin(), A.end()
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scpy(str1, str2) strcpy(str1, str2)
#define sfs(a) scanf("%s",a)
#define pf(a) printf("%d\n",a)
#define pfd(a,b) printf("%d %d\n",a,b)
#define pfP(a) printf("%d %d\n",a.fi,a.se)
#define pfs(a) printf("%s\n",a)
#define pfI(a) printf("%I64d\n",a)
#define mem(a,b) memset((a),b,sizeof(a))

#define fi first
#define se second
#define LL long long
#define DB double
#define isws ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double E = exp(1.0);

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }

int n, m;


int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("Out.txt", "w", stdout);
#endif
    LL score;
    while(~sf(n)) {
        while(n--) {
            sfI(score);
            if(score % 2 == 1) pfs("Balanced");
            else pfs("Bad");
        }
    }
    return 0;
}

5844
http://acm.hdu.edu.cn/showproblem.php?pid=5884

Sort

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 855 Accepted Submission(s): 169

Problem Description
Recently, Bob has just learnt a naive sorting algorithm: merge sort. Now, Bob receives a task from Alice.
Alice will give Bob N sorted sequences, and the i-th sequence includes ai elements. Bob need to merge all of these sequences. He can write a program, which can merge no more than k sequences in one time. The cost of a merging operation is the sum of the length of these sequences. Unfortunately, Alice allows this program to use no more than T cost. So Bob wants to know the smallest k to make the program complete in time.

Input
The first line of input contains an integer t0, the number of test cases. t0 test cases follow.
For each test case, the first line consists two integers N (2≤N≤100000) and T (∑Ni=1ai

//#include<bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#include <math.h>
#include <time.h>
#include <bitset>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <iostream>
#include <string.h>
#include <iterator>
#include <stdlib.h>
#include <algorithm>
using namespace std;
//#define ONLINE_JUDGE

#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define enter putchar(10)

#define rep(i,a,b) for(int i = (a); i < (b); ++i)
#define per(i,a,b) for(int i = (a); i >= (b); --i)
#define repe(i,a,b) for(int i = (a); i <= (b); ++i)

#define PR(a,b) pair<a,b>
#define slen(str) strlen(str)
#define ds(t) int t; sf(t)
#define Down(t) while(t--)
#define dc(t) int t; cin >> t;
#define dsD(t) ds(t); Down(t)
#define dcD(t) dc(t); Down(t)
#define ALL(A) A.begin(), A.end()
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scpy(str1, str2) strcpy(str1, str2)
#define sfs(a) scanf("%s",a)
#define pf(a) printf("%d\n",a)
#define pfd(a,b) printf("%d %d\n",a,b)
#define pfP(a) printf("%d %d\n",a.fi,a.se)
#define pfs(a) printf("%s\n",a)
#define pfI(a) printf("%I64d\n",a)
#define mem(a,b) memset((a),b,sizeof(a))

#define fi first
#define se second
#define LL long long
#define DB double
#define isws ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double E = exp(1.0);

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }

int n, m;
const int maxn = 100010;
LL a[maxn];
LL T;


template<class T>
void read(T & num) {     //int or LL
    bool start = false,neg = false;
    char c;
    num = 0;
    while((c=getchar()) != EOF) {
        if(c == '-') start = neg = true;
        else if(c >= '0' && c <= '9') {
            start = true;
            num = num*10+c-'0';
        } else if (start) break;
    }
    if(neg) num =- num;
}

void Init() {
    read(n); read(T);
    rep(i, 0, n) read(a[i]);
    sort(a, a + n);
}

bool check(int k) {
    LL maxsum = 0;
    queue<LL> q;
    int i = 0;
    int flag = (n - 1) % (k - 1);
    while(i < n || !q.empty()) {
        LL sum = 0;
        int k1 = k;
        if(flag != 0) {
            k1 = flag + 1;
            flag = 0;
        }
        while(k1--) {
            if(q.empty() && i < n) {
                sum += a[i++];
            }
            else if(i == n && !q.empty()) {
                sum += q.front(); q.pop();
            }
            else if(i < n && !q.empty()    ){
                if(a[i] < q.front()) {
                    sum += a[i++];
                }
                else {
                    sum += q.front(); q.pop();
                }
            }
        }
        maxsum += sum;
        if(!q.empty() || i < n) q.push(sum);
    }
    return maxsum <= T;
}

int solve() {
    int ans = n;
    int low = 2, high = n;
    while(low <= high) {
        int mid = (low + high) >> 1;
        if(check(mid)) ans = mid, high = mid - 1;
        else low = mid + 1;
    }
    return ans;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("Out.txt", "w", stdout);
#endif
    dsD(t) {
        Init();
        pf(solve());
    }
    return 0;
}
Triose_Stream
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
2016icpc网络赛——青岛赛区
shengtao96的专栏
09-21 1994
沈阳赛区前一天做的这个赛区的，做得也不好，这里补一下。 1001-I Count Two Three 题意：给出一个整数n, 找出一个大于等于n的最小整数m, 使得m可以表示为2a3b5c7d2^{a}3^b5^c7^d。 分析：很好想，因为数据是在1~1e9之间的，所以直接将所有2a3b5c7d2^{a}3^b5^c7^d的形式且小于1e9的数字打表，然后二分搜索出大于等于n的
2016 ICPC 青岛站 A【water】、B【模拟】、C【规律】、D【概率】
Irish_Moonshine的博客
12-03 494
A - Relic Discovery Recently, paleoanthropologists have found historical remains on an island in the Atlantic Ocean. The most inspiring thing is that they excavated in a magnificent cave and found th
2016ACMICPC青岛站 总结
I good vegetable a!
11-21 1650
啊， 好久没来写过博客了。最近事情太多了，各种作业+每周都有期末考试，今天抽空来写写青岛站的总结。 ------------------------------------------------------------------------------Day1-------------------------------------------------------------------
2016 ACM/ICPC亚洲区青岛站现场赛（部分题解）
aisebu7819的博客
10-27 352
摘要 　　本文主要列举并求解了2016 ACM/ICPC亚洲区青岛站现场赛的部分真题，着重介绍了各个题目的解题思路，结合详细的AC代码，意在熟悉青岛赛区的出题策略，以备战2018青岛站现场赛。 HDU 5984 Pocky 题意 　　给出一根棒子（可以吃的）的长度x和切割过程中不能小于的长度d，每次随机的选取一个位置切开，吃掉左边的一半，对右边的棒子同样操作，直至剩余...
2016 ACM/ICPC 青岛赛区网络赛 I Count Two Three
不激不随
10-26 359
#include<iostream> #include<vector> #include<algorithm>//杭电OJ没有g++的优化，cin/cout输入输出速度极慢，改成scanf printf就直接AC了 using namespace std;int main(){ const int N = 1000000001; int k; vector<int> v;
2019ICPC印尼网络赛.rar
10-06
《2019ICPC印尼网络赛：编程竞赛的魅力与挑战》 国际大学生程序设计竞赛（International Collegiate Programming Contest，简称ICPC）是一项全球性的计算机编程竞赛，旨在推动大学计算机科学教育的发展，培养学生的...
2018ICPC沈阳网络赛题解
09-09
这是2018ICPC沈阳网络赛的题解，这是2018ICPC沈阳网络赛的题解
2019ICPC韩国网络赛.pdf
10-06
2019icpc首尔网络赛 2019-10-5 2019 Asia Regional - Seoul - Nationwide Internet Competition
2018 ACM-ICPC 南京网络赛题目
09-01
2018 ACM-ICPC 南京网络赛题目
ICPC2023 西安区域赛 题解.pdf
最新发布
11-09
ICPC2023 西安区域赛 题解 本文档提供了 ICPC2023 西安区域赛的题解，涵盖了五个题目：A - An Easy Geometry Problem、B - Counting Multisets、C - Counting Strings、D - Deep Intervals 和 E - Dominating Point...
ACM-ICPC 2016 青岛赛区现场赛 A，Ｂ，Ｃ
布呗之路
08-19 255
题目链接：Relic Discovery #include <bits/stdc++.h> #define ll long long #define all(x) (x).begin(),(x).end() using namespace std; void scan() { #ifndef ONLINE_JUDGE freopen("input.txt", "r",...
2016年ICPC中国大陆区域赛(青岛）C题 （转载）
qq_43735840的博客
02-15 161
题目网址：点击进入 Problem Description Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating, of length L. While the length of remaining pock...
2016ICPC青岛赛区网络赛 1004
getupdown的博客
09-17 765
思维题。 一定要特判L=0的情况。 详见代码。 #include #include #include #include #include using namespace std; int main(){ long long L,R,ct; while(scanf("%lld%lld",&L,&R)==2){ if(L==0){
2016 大学生程序设计竞赛亚洲区域赛青岛赛区（ICPC）解题报告
hit_buxiaoyu的博客
12-20 1337
青岛赛区：（五题，但是有道题目一直T，最后绝杀过的，导致成为五题队中罚时最长的队） ProblemA: 题意：求和。 解题思路：两重循环直接求和，签到题。 过程：题目比较长，但是观察数据猜测大概题意后直接A掉。 ProblemB: 题意：二阶魔方的单次旋转模拟题。 解题思路：裸的模拟题。 过程：队友直接切掉。 ProblemC: 题意：给出长度为L的绳子，每次向绳子上的每一处等
2016ICPC青岛
qq_35975367的博客
07-13 185
2016ICPC青岛 题号 题目 难度 知识点 A Relic Discovery 签到 贪心 B Pocket Cube 快铜 大模拟 C Pocky 签到 数论，推公式 D Lucky Coins E Fibonacci F Lambda Calculus G Coding Contest 银牌题 网络流 H Pattern I Travel Brochure J Cliques K Finding Hotels L
2016 ACM青岛区域赛题解
HyperBeast的博客
08-11 2239
A 水题，直接暴力模拟即可。 #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 const int maxn=40000; typedef long long ll; int main(int argc, char const *argv[]) { int T; scanf("%d",&T); while(T--){
概率——2016青岛icpc区域赛 C - Pocky HDU - 5984 公式推导
GreyBtfly的博客
06-05 1799
博客目录 一、原题 原题传送门（vjudge） 原题传送门（杭电原题） Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating, of length L. While the length of rem...
hdu5878 2016青岛网络赛-打表+二分
猿的进化
09-17 527
I Count Two Three Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 167    Accepted Submission(s): 96 Problem Description I will show
2016年ICPC中国大陆区域赛(青岛）B题
qq_43735840的博客
02-12 108
题目网址：点击进入 Problem Description The Pocket Cube, also known as the Mini Cube or the Ice Cube, is the 2 × 2 × 2 equivalence of a Rubik’s Cube. The cube consists of 8 pieces, all corners. Each piece is la...
2023陕西ICPC邀请赛
09-15
引用提到，2023年ICPC全国邀请赛(陕西)今日开赛。作为一名弱鸡学生，你决定通过担任志愿者来为赛事贡献一份力量。引用中提到你从大二开始逐渐有了参加ICPC的想法，但由于实力较弱，参加了一些要求比较低的算法竞赛并...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值