计算机
ಠ_ರೃ大跌眼镜
这个作者很懒,什么都没留下…
展开
-
ucore lab6
然后挂上代码留个备份,以备日后查阅吧,有一部分参考了answer,这玩意不看不行啊,好多测试样例根据他的代码给出的,不同的策略结果不同就拿不到分啊,但是也大差不差,就是总以为自己写错了,其实只是策略不同,不必太深究。只能说这个项目很坑啊啊啊啊啊啊,除了写明我们需要修改的地方之外,answer和源码有很多不一样的地方,而且不知道是干什么用的,需要你自己找出不同来再插到源码上,否则项目起不来,具体过程就是很艰辛啊。源码这个斜堆也有比较值得学习的地方,直接拿过来了。中间很多杂事,这次终于对接了lab6。原创 2023-03-11 17:26:47 · 123 阅读 · 0 评论 -
E. Monsters (hard version)
这调试的代码成功让他上了个百行,炸裂,感觉有一次可以解的算法,懒得想了,线段树+树状数组你俩辛苦下搁着磨吧。离开集训队好长时间了,也很长时间没有碰这些代码了,最近觉得码力掉了很多,决定操练起来。ps 这bug调的整个人裂开,一瓶酒一包烟,一个算法写一天。原创 2023-02-13 20:01:57 · 262 阅读 · 0 评论 -
页面置换算法
【代码】页面置换算法。原创 2023-02-04 16:35:06 · 73 阅读 · 0 评论 -
ucore 内核线程创建
复制原进程的内存管理信息到新进程(但内核线程不必做此事)调用alloc_proc,首先获得一块用户信息块。复制原进程上下文到新进程。为进程分配一个内核栈。将新进程添加到进程列表。原创 2023-02-04 16:00:55 · 153 阅读 · 0 评论 -
E. DFS Trees
代码】E. DFS Trees。原创 2022-08-07 18:29:46 · 166 阅读 · 0 评论 -
E. Qpwoeirut and Vertices
给定l,r,对于任意两点l原创 2022-08-02 14:21:56 · 173 阅读 · 0 评论 -
146. LRU 缓存
代码】146.LRU缓存。原创 2022-07-14 22:14:08 · 117 阅读 · 0 评论 -
线段树区间修改查询懒标记
打卡原创 2022-06-11 19:44:41 · 91 阅读 · 0 评论 -
st表查询区间最大最小值
数据结构原创 2022-06-08 21:22:52 · 254 阅读 · 0 评论 -
D. Dog Walking
我们知道在最大值和最小值之外我们进行加减对答案是不影响的,而对于两个极值内部,我们一定会让他尽最大努力向一个方向走,因此我们可以把同一方向的放在一块。但是我们不知道极值在哪里,只知道结构,所以我们循环整个取值去尝试找到最大值就好了,答案一定是其中之一的情况/*input3 1001 2 -3*/#include<iostream>#include<algorithm>#include<cstring>using namespace std;.原创 2022-05-17 15:59:42 · 204 阅读 · 0 评论 -
Codeforces Round #785 (Div. 2) A~F
小细节卡的挺难受呀A. Subtle Substring SubtractionAlice肯定一下取走尽可能多的数/*input5abaabccbancodeforces*/#include<bits/stdc++.h>using namespace std;const int N=2e5+10;char s[N];int main(){ int t; cin>>t; while(t--) { int sum=0; scanf("原创 2022-05-06 22:25:22 · 520 阅读 · 0 评论 -
差分加模拟
题目#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int qz[N],hz[N];int cnt[N],sum[N];void update(int l,int r,int x,int *p){ p[l]+=x; p[r+1]-=x;}int main(){ int t; cin>>t; while(t--) { int n,m,q; scanf("%d%d%d",&原创 2021-12-13 11:13:53 · 984 阅读 · 0 评论 -
树状数组区间修改求和
/*input10 73 2 4 8 8 7 8 4 8 101 1 71 1 31 6 101 5 62 1 2 21 5 61 5 6*/#include<iostream>using namespace std;const int N=1e7+10;const int mod=998244353;bool p[N];int prime[N],s[N],cp;long long tree[4][N];int lowbit(int x){return x&a原创 2021-12-12 23:04:33 · 449 阅读 · 0 评论 -
Codeforces Round #751 (Div. 2) D. Frog Traveler
D. Frog Travelertime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFrog Gorf is traveling through Swamp kingdom. Unfortunately, after a poor jump, he fell into a well of nmeters depth. Now Gorf i原创 2021-10-25 22:41:06 · 355 阅读 · 0 评论 -
C - Count Triangles
Like any unknown mathematician, Yuri has favourite numbers: A, B, C, and D, where A≤B≤C≤D. Yuri also likes triangles and once he thought: how many non-degenerate triangles with integer sides x, y, and z exist, such that A≤x≤B≤y≤C≤z≤D holds?Yuri is prepari原创 2021-08-03 21:17:59 · 191 阅读 · 0 评论 -
Flip Game
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it’s black or white side up. Each round you flip 3 to 5 pieces,原创 2021-07-27 21:28:04 · 257 阅读 · 0 评论 -
A - This is an interesting question
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stic原创 2021-07-20 21:42:37 · 165 阅读 · 0 评论 -
C - Powered Addition
C - Powered AdditionYou have an array a of length n. For every positive integer x you are going to perform the following operation during the x-th second:Select some distinct indices i1,i2,…,ik which are between 1 and n inclusive, and add 2x−1 to each co原创 2021-07-12 22:25:51 · 249 阅读 · 0 评论 -
写好优化我不用,就是玩
dfs剪枝,优先遍历情况少的状态#include<iostream>#include<algorithm>using namespace std;int mp[10][11],H[10],L[10],O[10],ans=-1,ss[11][11],up[10];int score[10][10]={{0,0,0,0,0,0,0,0,0,0},{0,6,6,6,6,6,6,6,6,6},{0,6,7,7,7,7,7,7,7,6},{0,6,7,8,8,8,8,8,7,原创 2021-06-13 23:44:32 · 98 阅读 · 1 评论 -
蓝桥杯 国赛 2021
#include<iostream>using namespace std;int xl[100],cl;long long dp[2][100][100];int main(){ long long n; int k; cin>>n>>k; while(n) { xl[++cl]=n%2; n/=2; } for(int i=0;i<=cl;i++) dp[0][i]原创 2021-06-07 00:51:42 · 767 阅读 · 0 评论 -
A - Bear and Friendship Condition
并查集首先找到所有的连通块,对于连通块里所有的点两两都要连边,假设有i个点就需要i*(i-1)/2条边,计算总需要的边数是不是等于m即可#include<iostream>using namespace std;int fa[150010];int fifa(int x){ if(x==fa[x]) return x; return fa[x]=fifa(fa[x]);}void link(int x,int y){ fa[fifa(y)]=fifa(x原创 2021-06-01 21:09:06 · 165 阅读 · 0 评论 -
P3143 [USACO16OPEN]Diamond Collector S
Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected NN diamonds (N \leq 50,000N≤50,000) of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn.原创 2021-04-07 22:47:31 · 193 阅读 · 0 评论 -
C - Sonya and Queries
Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of one of the following type:+ ai — add non-negative integer ai to the multiset. N原创 2021-04-06 23:10:04 · 202 阅读 · 0 评论 -
欧拉筛和埃氏筛求质因子个数
埃氏筛法简单易懂直接上代码void solve(){ for(int i=2;i<=20000000;i++) if(!test[i]) for(int j=i;j<=20000000;j+=i) test[j]++;}欧拉筛:根据算法原理将一个非质数通过他的最小质因子筛出,留下的便是质数,s=ip如果p小于i的最小质因子s的质因子比i多1,否则相等。那么:void solve(){ int原创 2021-03-31 12:53:19 · 605 阅读 · 0 评论 -
B - Cormen — The Best Friend Of a Man
Recently a dog was bought for Polycarp. The dog’s name is Cormen. Now Polycarp has a lot of troubles. For example, Cormen likes going for a walk.Empirically Polycarp learned that the dog needs at least k walks for any two consecutive days in order to feel原创 2021-03-26 15:48:15 · 125 阅读 · 0 评论 -
A - Initial Bet
由题意看看c1,c2,c3,c4,c5是否可以恢复成b,b,b,b,b也就是sum是5的倍数并且(b>0)sum非零代码:#include<iostream>using namespace std;int main(){ int sum=0; for(int i=1;i<=5;i++) { int x; cin>>x; sum+=x; } if(sum&&s原创 2021-03-22 21:55:57 · 444 阅读 · 0 评论 -
Two Buildings
Two Buildings【分治】【决策单调性】There are n buildings along a horizontal street. The buildings are next to each other along the street, and the i-th building from left to right has width 1 and height hi. Among the n buildings, we are to find two buildings, say t原创 2021-02-20 16:39:58 · 449 阅读 · 0 评论 -
2021-02-01
D - Pagodasn pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from 1 to n. However, only two of them (labelled a and b, where 1≤a≠b≤n) withstood the test of time.Two monks, Yuwgna and Iaka, decide原创 2021-02-01 19:36:19 · 180 阅读 · 0 评论 -
B - Ternary Logic
B - Ternary LogicLittle Petya very much likes computers. Recently he has received a new “Ternatron IV” as a gift from his mother. Unlike other modern computers, “Ternatron IV” operates with ternary and not binary logic. Petya immediately wondered how the原创 2020-07-07 21:25:34 · 263 阅读 · 2 评论 -
Two Buttons
Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue butto原创 2020-07-05 10:47:14 · 237 阅读 · 0 评论 -
B - Tanya and Postcard
B - Tanya and PostcardLittle Tanya decided to present her dad a postcard on his Birthday. She has already created a message — string s of length n, consisting of uppercase and lowercase English letters. Tanya can’t write yet, so she found a newspaper and原创 2020-07-03 21:36:29 · 297 阅读 · 0 评论 -
Palindrome Dance
Palindrome DanceA group of n dancers rehearses a performance for the closing ceremony. The dancers are arranged in a row, they’ve studied their dancing moves and can’t change positions. For some of them, a white dancing suit is already bought, for some of原创 2020-06-02 23:09:28 · 147 阅读 · 0 评论 -
B. Chilly Willy
B. Chilly Willytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputChilly Willy loves playing with numbers. He only knows prime numbers that are digits yet. These numbers are 2, 3, 5 and 7. But Willy g原创 2020-05-21 22:50:05 · 224 阅读 · 0 评论 -
B - Rebranding
B - RebrandingThe name of one small but proud corporation consists of n lowercase English letters. The Corporation has decided to try rebranding — an active marketing strategy, that includes a set of...原创 2020-04-30 20:45:14 · 331 阅读 · 0 评论 -
A - 2Char
A - 2CharAndrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to th...原创 2020-04-27 22:09:23 · 282 阅读 · 0 评论