CV的人有福啦!YTU贪心训练2(部分注释)

合集 - 刷题集(97)

1.妖梦拼木棒2023-05-23 2.[USACO1.2]回文平方数 Palindromic Squares2023-05-24 3.[COCI2012-2013#1] LJUBOMORA2023-05-25 4.火柴棒等式2023-05-25 5.Kieszonkowe2023-05-25 6.[COCI2014-2015#5] TRAKTOR2023-05-26 7.硬币翻转2023-05-26 8.[蓝桥杯 2020 省 AB1] 走方格2023-05-26 9.P2097 资料分发2023-05-26 10.[AHOI2005]约数研究2023-05-26 11.[NOIP2004 普及组] 火星人2023-05-26 12.我焯,原神(这真是个题)2023-05-26 13.滑雪 OJ36512023-05-24

14.CV的人有福啦!YTU贪心训练2(部分注释)2023-05-27

15.砝码称重2023-05-27 16.警钟长鸣-----找零钱2023-05-28 17.[USACO09OCT]Barn Echoes G2023-05-28 18.【CSGRound2】光骓者的荣耀2023-05-29 19.初见蓝桥杯2023-05-30 20.[蓝桥杯 2022 省 B] 扫雷2023-05-31 21.开餐馆2023-05-31 22.P9241 [蓝桥杯 2023 省 B] 飞机降落2023-06-01 23.P7083 [NWRRC2013] Energy Tycoon2023-06-03 24.高精度2023-06-04 25.P7954 [COCI2014-2015#6] PAPRIKA2023-06-04 26.(输出路径搜索)[USACO06OCT] Cows on Skates G2023-06-04 27.畜栏保留问题2023-06-04 28.(贪心+搜索+剪枝)P8801 [蓝桥杯 2022 国 B] 最大数字2023-06-05 29.蓝桥杯入门----普及-2023-06-06 30.[NOIP2016 提高组] 玩具谜题2023-06-06 31.[NOIP2002 提高组] 字串变换(无向图查重)2023-06-06 32.[NOIP2000 提高组] 单词接龙2023-06-07 33.POJ 硬币2023-06-07 34.动态规划学习 1(最长上升子序列问题)2023-06-07 35.动态规划学习 2(背包问题及其变形)2023-06-08 36. 切割回文2023-06-10 37.[NOIP2001 提高组] 数的划分(剪枝)2023-06-10 38.字符串转换数字,sscanf和sprintf大法2023-06-10 39.[CTSC1997] 选课(树状DP)2023-06-10 40. k 倍区间(同余定理,组合数)2023-06-11 41.[蓝桥杯 2018 省 AB] 全球变暖2023-06-11 42.马的遍历(对bfs的更深一层探讨)2023-06-11 43.找零钱2023-06-11 44.Pasha Maximizes2023-06-12 45.Newspaper Headline2023-06-12 46.Balanced Ternary String2023-06-13 47.(数论)素数,质数2023-06-13 48.(数论) 约数2023-06-13 49.Helping the Nature2023-06-14 50.(博弈论)Even Number Addicts2023-06-14 51.Present2023-06-15 52.Mr. Kitayuta's Colorful Graph(二维并查集,弱化版)2023-06-16 53.Edgy Trees(dfs,并查集,快速幂,树形结构,红黑树)2023-06-16 54.并查集2023-05-24 55.再谈前缀和,差分,离散化2023-06-16 56.Best Cow Fences(前缀和+特殊二分)2023-06-17 57.二分2023-06-17 58.同类型,类背包动态规划,选地dp2023-06-17 59.Primes on Interval(欧拉筛+二分+滑动窗口)2023-06-18 60.字符串(KMP , Trie树 , STL)2023-06-18 61.Codeforces1 #879 div.22023-06-19 62.Add Modulo 10(数论,思维,数学,规律)2023-06-20 63.期末考试YTU4035: Shmily(数学,等差数列)2023-06-20 64.[POI2006] OKR-Periods of Words2023-06-21 65.Getting Zero(Bfs)2023-06-21 66.快速幂2023-06-21 67.Dreaming of Freedom(数论,贪心)2023-06-23 68.Scoring Subsequences2023-06-24 69.Dolce Vita2023-06-29 70.Cake Assembly Line2023-06-29 71.Constructive Problem2023-06-30 72.Forever Winter2023-06-30 73.Maximum Sum(前缀和)2023-07-10 74.Contrast Value(数学规律)2023-07-10 75.Lamps(STL+双端队列)2023-07-10 76.Long Long2023-07-11 77.Sum in Binary Tree2023-07-11 78.Apple Tree(树状搜索,树形DP)2023-07-11 79.Strong Password(贪心思想)2023-07-12 80.Come Together2023-07-12 81.Notepad2023-07-13 82.Hamiltonian Wall2023-07-13 83.7.17作业2023-07-16 84.逛画展(双指针)2023-07-19 85.#8852023-07-20 86.树状数组2023-07-20 87.Subsequence Addition2023-07-22 88.7.22作业2023-07-22 89.Diverse Substrings2023-07-24 90.Tracking Segments(二分,区间前缀)2023-07-27 91.最大食物链计数2023-07-27 92.线段树12023-07-22 93.[TJOI2007] 线段(状态机)2023-07-29 94.#8782023-07-30 95.测试12023-07-30 96.李白打酒2023-07-30 97.砍竹子2023-07-30

警钟长鸣----J题我做了40分钟一直不知道为什么错,后来发现错在哪了结果超时了(dp>搜索)

无聊做了做(第一题就被水了)

1743 Problem A

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100010;
 4 int n,k,s[N],a[N],sum[N],ans,x,y,res;
 5 int main()
 6 {
 7     cin>>n>>k;
 8     for(int i=0;i<n;i++) cin>>a[i];
 9     sort(a,a+n);
10     while(y<n)
11     {
12         s[x]+=a[y],sum[x]+=s[x];
13         x++,y++;
14         if(x==k) x=0;
15     }
16     for(int i=0;i<k;i++) res+=sum[i];
17     printf("%.0lf",(double)res/n);
18     return 0;
19 }

1757 Problem B

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100010;
 4 struct node
 5 {
 6     int x,y;
 7     bool operator<(const node &w)const
 8     {
 9         return x<w.x;
10     }
11 }range[N];
12 int n,res;
13 int main()
14 {   
15     cin>>n;
16     for(int i=0;i<n;i++)
17     {
18         int a,b;
19         cin>>a>>b;if(a>b) swap(a,b);
20         range[i]={a,b};
21     }
22     sort(range,range+n);
23     int ed=range[0].r;
24     for(int i=1;i<n;i++)
25     {
26         if(range[i].x<=ed) res++;
27         else ed=range[i].y;
28     }
29     cout<<res;
30     return 0;
31 }

1002 Problem C

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100010;
 4 int n,m;
 5 double res;
 6 struct node
 7 {
 8     double t,v,x;
 9     bool operator<(const node &w)const
10     {
11         return x>w.x;
12     }
13 }f[N];
14 int main()
15 {
16     while(cin>>n>>m&&n!=0)
17     {
18         memset(f,0,sizeof f);
19         res=0;
20         for(int i=1;i<=n;i++) cin>>f[i].t>>f[i].v,f[i].x=f[i].v/f[i].t;
21         sort(f+1,f+n+1);
22         for(int i=1;i<=n;i++)
23         {
24             if(m-f[i].t<0)
25             {
26                 res+=f[i].x*(double)m;
27                 break;
28             }
29             else m-=f[i].t,res+=(double)f[i].v;
30         }
31         printf("%.2lf\n",res);
32     }
33     return 0;
34 }

2461 Problem D

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100010;
 4 int n,res;
 5 struct node
 6 {
 7     int x,y;
 8     bool operator<(const node &w )const
 9     {
10         return y<w.y;
11     }
12 }ran[N];
13 int main()
14 {
15     while(cin>>n&&n!=0)
16     {
17         res=0;
18         for(int i=1;i<=n;i++) cin>>ran[i].x>>ran[i].y;
19         sort(ran+1,ran+1+n);
20         int ed=ran[1].y;
21         for(int i=2;i<=n;i++)
22             if(ran[i].x>=ed)
23             {
24                 res++;
25                 ed=ran[i].x;
26             }
27         cout<<res;
28     }
29     return 0;
30 }

1746 Problem E

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=1000010;
 4 int n,k,a[N],res=1;
 5 int main()
 6 {
 7     cin>>n>>k;
 8     for(int i=0;i<n;i++) cin>>a[i];
 9     sort(a,a+n);
10     int ed=a[0]+k;
11     for(int i=1;i<n;i++)
12         if(a[i]>ed)
13         {
14             res++;
15             ed=a[i]+k;
16         }
17     cout<<res;
18     return 0;
19 }

2897 Problem F

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=1000010;
 4 int n,k,m,r,res;
 5 struct node
 6 {
 7     int l,r;
 8 }p[N];
 9 bool cmp(node a,node b)
10 {
11     if(a.r==b.r) return a.l<b.l;
12     else return a.r<b.r;
13 }
14 int main()
15 {
16     cin>>k;
17     while(k--)
18     {
19         res=1;
20         cin>>n>>r;
21         for(int i=1;i<=n;i++)
22         {
23             int a,b;
24             cin>>a>>b;
25             double x=sqrt(r*r-b*b);
26             p[i].l=a-x,p[i].r=a+x;
27         }
28         sort(p+1,p+1+n,cmp);
29         int ed=p[1].r;
30         for(int i=2;i<=n;i++)
31             if(p[i].l>ed) res++,ed=p[i].r;
32         cout<<res<<endl;
33     }
34     return 0;
35 }

3394 Problem G

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100010;
 4 int n,m,res,sum;
 5 struct node
 6 {
 7     double num,v;
 8     bool operator<(const node&w)const
 9     {
10         return v>w.v;//按价值排序
11     }
12 }f[N];
13 bool vis;
14 int main()
15 {
16     cin>>n>>m;
17     int p=m;
18     for(int i=0;i<n;i++)
19     {
20         double a,b,c;
21         cin>>a>>b>>c;
22         sum+=b;
23         if(a>b) vis=true;//判断
24         res+=a*c;
25         m-=a;
26         f[i]={b-a,c};  
27     }
28     if(sum<p) vis=true;//判断
29     if(vis) {
30         cout<<"-1";
31         return 0;
32     }
33     sort(f,f+n);
34     for(int i=0;i<n;i++) cout<<f[i].v<<" ";
35     for(int i=0;i<n;i++)
36     {
37         if(m<=0) break;
38         while(f[i].num&&m!=0)//这里错了,注意啊,m不能等于0
39         {
40             m--;
41             f[i].num--;
42             res+=f[i].v;
43         }
44     }
45     cout<<res;
46     return 0;
47 }

1310 Problem H

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100;
 4 int n,a[5]={1,3,9,27,81},f[N];
 5 string s;
 6 bool vis;
 7 void dfs(int st,int t,int num,int step)
 8 {
 9     if(vis) return;
10     if(num==t)
11     {
12         for(int i=0;i<step+1;i++)
13         {
14             if(i<step) cout<<f[i]<<s[i];
15             else cout<<f[i];
16         }
17         vis=true;
18     }
19     if(num>t) for(int i=st-1;i>=0;i--)
20     {
21         f[step+1]=a[i],s[step]='-';
22         dfs(i,t,num-a[i],step+1);
23         f[step+1]=0;
24     }
25     else for(int i=st-1;i>=0;i--)
26     {
27         f[step+1]=a[i],s[step]='+';
28         dfs(i,t,num+a[i],step+1);
29         f[step+1]=0;
30     }
31     return;
32 }
33 int main()
34 {
35     cin>>n;
36     int p;
37     if(n<=81)
38     {for(int i=0;i<5;i++) if(a[i]>=n){p=i;break;}}
39     else p=4;
40     f[0]=a[p];
41     dfs(p,n,a[p],0);
42     return 0;
43 }

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N=100000;
 4 int n,k,res,a[5]={1,3,9,27,81};
 5 int main()
 6 {
 7     cin>>n;
 8     if(n<=81)
 9     {for(int i=0;i<5;i++) if(a[i]>=n) {k=i;break;}}//找到最接近的
10     else k=4;
11     res=a[k];
12     cout<<a[k];
13     int num=0;
14     while(res!=n)
15     {
16         int x,c;
17         for(int i=0;i<4;i++)
18             if(a[i]<=abs(n-res)&&a[i+1]>=abs(n-res)) {x=i;break;}//找到处于这之间的
19         if(abs(a[x]-res+n)>abs(a[x+1]-res+n)) c=x+1;//找到最接近的那个
20         else c=x;
21         if(res>n) cout<<'-'<<a[c],res-=a[c];//判断
22         else cout<<'+'<<a[c],res+=a[c];
23     }
24     return 0;
25 }

3155 Problem I

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int a,b,c,d,e,f,res;
 4 int op[4]={0,5,3,1};
 5 int main()
 6 {
 7     while(cin>>a>>b>>c>>d>>e>>f&&(a+b+c+d+e+f)!=0)
 8     {
 9         res=f+d+e+(c+3)/4;
10         int x=d*5+op[c%4];//先算2x2的箱子
11         if(b>x) res+=(b-x+8)/9;
12         int y=36*res-36*f-25*e-16*d-9*c-4*b;
13         if(a>y) res+=(a-y+35)/36;
14         cout<<res<<endl;
15     }
16     return 0;
17 }

1914 Problem J (做了好久真的,就被卡了一个条件,做出来了结果还超时,上网搜答案发现要用动态规划,真的崩溃)

 1 #include <iostream>
 2 using namespace std;
 3 int COUNT;
 4 int cost[]={1,2,5,10,20,50,100};
 5 int main()
 6 {
 7     int n;
 8     int i;
 9     int s[251][102][8]={0};   
10     for(i=0;i<7;i++)
11     {
12         s[ cost[i] ][1][i]=1;
13     }
14     s[1][101][0]=1;
15     for(i=2;i<251;i++) 
16     {
17         for(int j=1;j<=i&&j<101;j++)
18         {
19             for(int k=6;k>=0;k--)
20             {
21                 if(i>cost[k])
22                 {
23                     for(int l=k;l>=0;l--)
24                     {
25                         s[i][j][k]+=s[ i-cost[k] ][j-1][l];
26                     }
27                 }
28                 s[i][j][7]+=s[i][j][k];
29             }
30             s[i][101][0]+=s[i][j][7];
31         }
32     }
33     while(cin>>n&&n!=0)
34     {
35         cout<<s[n][101][0]<<endl;
36     }
37     return 0;
38 }

3509 Problem K

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int a[1000010],n,res,s[1000010];
 4 int main()
 5 {
 6     cin>>n;
 7     for(int i=1;i<=n;i++) cin>>a[i];
 8     for(int i=1;i<n;i++)
 9     {
10         sort(a+1,a+1+n);//每次排序找最小的就可以
11         a[i+1]+=a[i];
12         res+=a[i+1];
13     }
14     cout<<res;
15     return 0;
16 }

__EOF__

本文作者：Sakurajimamai
本文链接：https://www.cnblogs.com/o-Sakurajimamai-o/p/17437151.html
关于博主：评论和私信会在第一时间回复。或者直接私信我。
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！