algzjh的博客

时间限制：1秒 空间限制：32768K 题目描述 美团点评上有很多餐馆优惠券，用户可以在美团点评App上购买。每种优惠券有一个唯一的正整数编号。每个人可以拥有多张优惠券，但每种优惠券只能同时拥有至多一张。每种优惠券可以在使用之后继续购买。当用户在相应餐馆就餐时，可以在餐馆使用优惠券进行消费。某人优惠券的购买和使用按照时间顺序逐行记录在一个日志文件中，运营人员会定期抽查日志文件看业务是否正确。业

Rikka with CompetitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 479 Accepted Submission(s): 393Problem Description As we know, Rikka

Is Derek lying?Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 412 Accepted Submission(s): 248Problem Description Derek and Alfia are good

Regular polygonTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1105 Accepted Submission(s): 412Problem Description On a two-dimensional pla

Bit-reversal PermutationDescriptionA fast Fourier transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IFFT). Fourier analysis converts a signal from i

今夕何夕Accepts: 1345 Submissions: 5533 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description今天是2017年8月6日，农历闰六月十五。小度独自凭栏，望着一轮圆月，发出了“今夕何夕，见此良人”的寂寞感慨。为了排遣郁结

C - 4-adjacent Time limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem Statement We have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer.Snuke’s objective is to permut

Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 47526    Accepted Submission(s): 17954Problem DescriptionGiven a po

Candy DistributionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6009Accepted: 3339DescriptionN children standing in circle who are numbered 1 throu

find the nth digitTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11884    Accepted Submission(s): 3572Problem Description假设：S1

Euler theoremTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 157 Accepted Submission(s): 132Problem Description HazelFan is given two pos

C - 4/NTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem Statement You are given an integer N.Find a triple of positive integers h, n and w such that 4⁄N=1⁄h+1⁄n+1⁄w.If there are multi

链接：ARC088-D-Wide Flip 题目大意：给出一个长度为10510^5的01串，操作是每次选一个长度至少为KK的区间，将01反转，可进行多次操作，要使得最后为全0，问KK最大为多少。 解题思路： 对于字符串s[1…n]s[1 \dots n] 考虑相邻两位不同si≠si+1s_i \neq s_{i+1}，要使得两位相同，最大可操作连续范围为max(i,n−i)max(i,n-i

InversionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 562 Accepted Submission(s): 378Problem Description Give an array A, the index star

Hybrid CrystalsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 316 Accepted Submission(s): 186Problem Description Kyber crystals, also cal

题目描述 Alice 和 Bob 开始了吃瓜比赛。现在有 nnn 个单位的瓜，两个人每次可以拿起 111 到 LLL 某个整数单位的瓜，拿了 kkk 单位的瓜后必须花 kkk 单位的时间吃掉手里的瓜才能继续拿瓜吃，直到瓜全都被吃完。而且 Alice 和 Bob 不能拿对方手里的瓜。假设拿瓜是可以在瞬间完成的。还假设 Alice 的反应速度总是比 Bob 快，意思是：若两人在一瞬间内同时拿瓜，则必定

A. Unimodal Arraytime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Array of integers is unimodal, if:it is strictly increasing in the beginnin

C. Jury Markstime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Polycarp watched TV-show where k jury members one by one rated a participant b

B. Mister B and Angle in Polygontime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output On one quiet day all of sudden Mister B decided to draw ang

C - Splitting PileTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem Statement Snuke and Raccoon have a heap of N cards. The i-th card from the top has the integer ai written on it.They

LXX数Description 又是一年集训时，刚出家里赶来的LXX很是郁闷。因为CS市的天气实在是难以忍受了，加之搬寝室到CS大学“老”校区。一天晚上CS大学“老”校区的寝室又停电了，LXX和室友实在是难以呆下去了。于是商量一起去网吧吹空调，但是谁请客是个问题。LXX的室友小Z便甩出一个问题给LXX，只要LXX在1S内计算出来便请客。问题如下： 我有n个数，a[1]~a[n],初始值均为0，现

D - Decrease (Contestant ver.)Time limit : 2sec / Memory limit : 256MBScore : 600 pointsProblem Statement We have a sequence of length N consisting of non-negative integers. Consider performing the fo

E - Decrease (Judge ver.)Time limit : 2sec / Memory limit : 256MBScore : 600 pointsProblem Statement We have a sequence of length N consisting of non-negative integers. Consider performing the followi

A. The Meaningless Gametime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Slastyona and her loyal dog Pushok are playing a meaningless game t

Rikka with SubsetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 513 Accepted Submission(s): 218Problem Description As we know, Rikka is po

RXD and mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 448 Accepted Submission(s): 230Problem Description RXD is a good mathematicia

Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 34150 Accepted Submission(s): 14867Problem Description “OK, you

Kanade’s sumTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 664 Accepted Submission(s): 256Problem Description Give you an array A[1..n]of

Even Digits#include <bits/stdc++.h>using namespace std;typedef long long LL;vector<LL> vn,vs,vl;LL n;LL p10[17];void init(){ vn.clear(); vs.clear(); vl.clear(); p10...