HDU 4352 XHXJ's LIS
39 HDU LIS
2023-09-11 14:15:28 时间
XHXJ's LIS
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1423 Accepted Submission(s): 544
Problem Description
#define xhxj (Xin Hang senior sister(学姐))
If you do not know xhxj, then carefully reading the entire description is very important.
As the strongest fighting force in UESTC, xhxj grew up in Jintang, a border town of Chengdu.
Like many god cattles, xhxj has a legendary life:
2010.04, had not yet begun to learn the algorithm, xhxj won the second prize in the university contest. And in this fall, xhxj got one gold medal and one silver medal of regional contest. In the next year's summer, xhxj was invited to Beijing to attend the astar onsite. A few months later, xhxj got two gold medals and was also qualified for world's final. However, xhxj was defeated by zhymaoiing in the competition that determined who would go to the world's final(there is only one team for every university to send to the world's final) .Now, xhxj is much more stronger than ever,and she will go to the dreaming country to compete in TCO final.
As you see, xhxj always keeps a short hair(reasons unknown), so she looks like a boy( I will not tell you she is actually a lovely girl), wearing yellow T-shirt. When she is not talking, her round face feels very lovely, attracting others to touch her face gently。Unlike God Luo's, another UESTC god cattle who has cool and noble charm, xhxj is quite approachable, lively, clever. On the other hand,xhxj is very sensitive to the beautiful properties, "this problem has a very good properties",she always said that after ACing a very hard problem. She often helps in finding solutions, even though she is not good at the problems of that type.
Xhxj loves many games such as,Dota, ocg, mahjong, Starcraft 2, Diablo 3.etc,if you can beat her in any game above, you will get her admire and become a god cattle. She is very concerned with her younger schoolfellows, if she saw someone on a DOTA platform, she would say: "Why do not you go to improve your programming skill". When she receives sincere compliments from others, she would say modestly: "Please don’t flatter at me.(Please don't black)."As she will graduate after no more than one year, xhxj also wants to fall in love. However, the man in her dreams has not yet appeared, so she now prefers girls.
Another hobby of xhxj is yy(speculation) some magical problems to discover the special properties. For example, when she see a number, she would think whether the digits of a number are strictly increasing. If you consider the number as a string and can get a longest strictly increasing subsequence the length of which is equal to k, the power of this number is k.. It is very simple to determine a single number’s power, but is it also easy to solve this problem with the numbers within an interval? xhxj has a little tired,she want a god cattle to help her solve this problem,the problem is: Determine how many numbers have the power value k in [L,R] in O(1)time.
For the first one to solve this problem,xhxj will upgrade 20 favorability rate。
If you do not know xhxj, then carefully reading the entire description is very important.
As the strongest fighting force in UESTC, xhxj grew up in Jintang, a border town of Chengdu.
Like many god cattles, xhxj has a legendary life:
2010.04, had not yet begun to learn the algorithm, xhxj won the second prize in the university contest. And in this fall, xhxj got one gold medal and one silver medal of regional contest. In the next year's summer, xhxj was invited to Beijing to attend the astar onsite. A few months later, xhxj got two gold medals and was also qualified for world's final. However, xhxj was defeated by zhymaoiing in the competition that determined who would go to the world's final(there is only one team for every university to send to the world's final) .Now, xhxj is much more stronger than ever,and she will go to the dreaming country to compete in TCO final.
As you see, xhxj always keeps a short hair(reasons unknown), so she looks like a boy( I will not tell you she is actually a lovely girl), wearing yellow T-shirt. When she is not talking, her round face feels very lovely, attracting others to touch her face gently。Unlike God Luo's, another UESTC god cattle who has cool and noble charm, xhxj is quite approachable, lively, clever. On the other hand,xhxj is very sensitive to the beautiful properties, "this problem has a very good properties",she always said that after ACing a very hard problem. She often helps in finding solutions, even though she is not good at the problems of that type.
Xhxj loves many games such as,Dota, ocg, mahjong, Starcraft 2, Diablo 3.etc,if you can beat her in any game above, you will get her admire and become a god cattle. She is very concerned with her younger schoolfellows, if she saw someone on a DOTA platform, she would say: "Why do not you go to improve your programming skill". When she receives sincere compliments from others, she would say modestly: "Please don’t flatter at me.(Please don't black)."As she will graduate after no more than one year, xhxj also wants to fall in love. However, the man in her dreams has not yet appeared, so she now prefers girls.
Another hobby of xhxj is yy(speculation) some magical problems to discover the special properties. For example, when she see a number, she would think whether the digits of a number are strictly increasing. If you consider the number as a string and can get a longest strictly increasing subsequence the length of which is equal to k, the power of this number is k.. It is very simple to determine a single number’s power, but is it also easy to solve this problem with the numbers within an interval? xhxj has a little tired,she want a god cattle to help her solve this problem,the problem is: Determine how many numbers have the power value k in [L,R] in O(1)time.
For the first one to solve this problem,xhxj will upgrade 20 favorability rate。
Input
First a integer T(T<=10000),then T lines follow, every line has three positive integer L,R,K.(
0<L<=R<263-1 and 1<=K<=10).
0<L<=R<263-1 and 1<=K<=10).
Output
For each query, print "Case #t: ans" in a line, in which t is the number of the test case starting from 1 and ans is the answer.
Sample Input
1
123 321 2
Sample Output
Case #1: 139
Author
peterae86@UESTC03
Source
解题:数位dp
1 #include <bits/stdc++.h> 2 using namespace std; 3 typedef long long LL; 4 LL dp[25][1<<10][11],L,R; 5 int k,b[25],dy[1<<10]; 6 int calc(int st){ 7 if(dy[st] != -1) return dy[st]; 8 int x = st; 9 st = (st&0x55555555) + ((st>>1)&0x55555555); 10 st = (st&0x33333333) + ((st>>2)&0x33333333); 11 st = (st&0x0F0F0F0F) + ((st>>4)&0x0F0F0F0F); 12 st = (st&0x00FF00FF) + ((st>>8)&0x00FF00FF); 13 st = (st&0x0000FFFF) + ((st>>16)&0x0000FFFF); 14 return dy[x] = st; 15 } 16 int update(int x,int s){ 17 for(int i = x; i < 10; ++i) 18 if(s&(1<<i)) return (s^(1<<i))|(1<<x); 19 return s|(1<<x); 20 } 21 LL dfs(int p,int st,bool flag,bool low){ 22 if(!p) return calc(st) == k; 23 if(flag && dp[p][st][k] != -1) return dp[p][st][k]; 24 LL ret = 0; 25 int u = flag?9:b[p]; 26 for(int i = 0; i <= u; ++i) 27 ret += dfs(p-1,(low || i > 0)?update(i,st):0,flag || (i < u),(low || i > 0)); 28 if(flag) dp[p][st][k] = ret; 29 return ret; 30 } 31 LL solve(LL x){ 32 int len = 0; 33 while(x){ 34 b[++len] = x%10; 35 x /= 10; 36 } 37 return dfs(len,0,0,0); 38 } 39 int main(){ 40 int kase,cs = 1; 41 memset(dp,-1,sizeof dp); 42 memset(dy,-1,sizeof dy); 43 scanf("%d",&kase); 44 while(kase--){ 45 scanf("%I64d%I64d%d",&L,&R,&k); 46 printf("Case #%d: ",cs++); 47 printf("%I64d\n",solve(R) - solve(L-1)); 48 } 49 return 0; 50 }
相关文章
- What's the difference between {% tag variable%} and {{variable}}
- How do I view a single file's history in GitK?
- What's the technical reason for "lookbehind assertion MUST be fixed length" in regex?
- 'workspace' in VS Code
- mysql客户端(Navicat)远程登录操作遇到问题1142 - XXX command denied to ×××
- HDU 3341 Lost's revenge
- HDU 2204 Eddy's爱好
- POJ 3207 Ikki's Story IV - Panda's Trick
- 使用PPA在Elementary OS 'Luna'上安装Oracle Java 7
- .NET错误The 'targetFramework' attribute in the <compilation> element of the Web.config file is used only to target version 4.0 and later of the .NET Framework
- POJ 2348 Euclid's Game (博弈)
- HDU 5023 A Corrupt Mayor's Performance Art (据说是线段树)
- HDU 5024 Wang Xifeng's Little Plot (DP)
- HDU 1165 Eddy's research II (找规律)
- HDU 4352 XHXJ's LIS (数位DP+LIS+状态压缩)
- HDU 3177 Crixalis's Equipment (贪心,差值)
- HDU 1756 Cupid's Arrow (几何问题,判定点在多边形内部)
- Ionic Framework - Getting 'ionic start [appName]' Working Behind a Proxy
- 【HDU 1009】FatMouse' Trade
- 编译出错 ------ undefined reference to `ceilf'
- 【LeetCode】119. Pascal's Triangle II
- hdu 1162 Eddy's picture (prim)
- sqlserver 出现 因为文件组 'PRIMARY' 已满 的解决办法 有可能是磁盘剩余空间不足 导致的
- libtool: link: `dftables.lo' is not a valid libtool object
- Description: Failed to configure a DataSource: 'url' attribute is not specified and no embedded datasource could be configured. Reason: Failed to determine a suitable driver class
- 远程连接mariadb时提示Accesss denied for user 'root'@'ip'(using password:YES)
- 跑mmaction代码遇到的问题:KeyError: 'xxxDataset is not in the dataset registry' when test #3751
- x.strip().split(' ')