模拟
关注
分享
扫一扫
文章平均质量分 80
KeyboardPianist
这个作者很懒，什么都没留下…
展开
-
HUD Average 5353模拟
AverageTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2641 Accepted Submission(s): 624Special JudgeProblem DescriptionThere ar原创 2015-09-03 22:09:16 · 498 阅读 · 0 评论 -
Codeforces681C Heap Operations
C. Heap Operationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya has recently learned data structure named "Binary heap".原创 2016-07-23 20:54:44 · 554 阅读 · 0 评论 -
Educational Codeforces Round 4 C. Replace To Make Regular Bracket Sequence
C. Replace To Make Regular Bracket Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s consists原创 2015-12-26 16:58:19 · 443 阅读 · 0 评论 -
HDU 1237 简单计算器
简单计算器Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15736 Accepted Submission(s): 5370Problem Description读入一个只包含 +, -, *, / 的非负整原创 2015-12-05 22:59:12 · 349 阅读 · 0 评论 -
Educational Codeforces Round 2 A. Extract Numbers
A. Extract Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Let's call word any larg原创 2015-12-16 13:03:59 · 808 阅读 · 0 评论 -
HDU 4740 The Donkey of Gui Zhou
模拟即可，不能走各自已经走过的路，不能转两次弯 #include #include #include #define maxn 1005using namespace std;struct node{ int x, y, flag, Time, isMove;};node dk, t;bool vis[maxn][maxn][2];int dx[原创 2015-08-11 11:00:37 · 457 阅读 · 0 评论 -
Educational Codeforces Round 1 B. Queries on a String
题目：点击打开链接求余然后模拟#include #include #define maxn 20005char s[maxn], c[maxn];void fun(int l, int r, int k){ int Move = k%(r-l+1), p; for(int i = l;i <= r;i++){ p = i - l;原创 2015-11-14 08:33:00 · 512 阅读 · 0 评论 -
HDU 5477 A Sweet Journey
L长度的旅途，有n个沼泽地，在沼泽地里每单位距离消耗A能量，平地每单位距离回复B能量（除了沼泽都是平地），问一开始至少要多少能量才能走完这段路。让一开始的能量为0，模拟一遍，得到的能量最小值（小于等于0）*(-1)就是答案#include int l[105], r[105];int main(){ int t, i, A, B, n, L, min, tmp, k;原创 2015-10-06 23:21:10 · 612 阅读 · 0 评论 -
hihoCoder 1228 Mission Impossible 6
The 2015 ACM-ICPC Asia Beijing First Round Online Programming CoL：如果光标左边还有字符，光标左移R：如果光标右移还有字符，光标右移S：切换模式（插入模式，复写模式），初始时默认为“插入模式”，然后每次遇到S都切换模式B：如果光标左边有一个字符，删除D：如果光标右边有一个字符，删除C：复制，初始化为NOTHIN原创 2015-09-26 23:32:20 · 662 阅读 · 0 评论 -
Codeforces670E. Correct Bracket Sequence Editor
E. Correct Bracket Sequence Editortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Polycarp started to develop a text ed原创 2016-07-27 22:10:07 · 396 阅读 · 0 评论