-
Bio
充值使用 ide
Macesuted 可爱! || 个人题库
BZOJ 审核组 & 维护组成员
找我审核用 HydroOJ 私信联系。
现在维护的:1325 ~ 1349(1328 ~ 1349 已完成)
我维护的:2525 ~ 2549 | 3300 ~ 3324
我审核的:3925 ~ 3949
https://hydro.ac/d/bzoj/discuss/6152da6f0cd2b890c7864bfa#1634563941796
LXGWWenKai-Regular
↑ 2023.05.29 留
题目 RP 计算规则:
- 根据做题情况计算得分。在 HydroOJ 主站的 system 域中将会合并 codeforces/luogu/ccf/bzoj/uoj/spoj/poj 远端评测域的做题数据。
- 记某题难度为 ,得分为 ,则得分增加 。
- 记累计得分为 ,则最终得分为 ;若得分为负数,就记为 分。
RP 隐藏彩蛋:
- 题解也算贡献。
- 计算总 RP 时,用户活跃度将有附加分。
发送富文本信息
db.message.insert({from:1,to:2,content:'{"message":"系统检测到你创建了垃圾用户 {0},已经封禁账号。","params":["milmon"]}',flag:5})
var response = await fetch(window.location.pathname, { "headers": { "accept": "application/json", }, "method": "GET", }); var json = await response.json(); var fullScore = [100, 100, 100, 100, 100, 100, 100]; var totalUser = 0, ac = new Array(fullScore.length).fill(0); var acRate1 = new Array(fullScore.length).fill(0); var acRate2 = new Array(fullScore.length).fill(0); for (var row of json.rows) { if (row[0].value == '#' || row[0].value == '0') continue; if (row[2].value > 0) { totalUser++; for (var i = 3; i < row.length; i++) if (parseInt(row[i].value) == fullScore[i - 3]) ac[i - 3]++; } } for (var pid = 0; pid < fullScore.length; pid++) acRate1[pid] = (ac[pid] / totalUser * 100).toFixed(0), ac[pid] = 0; var cnt = 0; for (var row of json.rows) { if (row[0].value == '#' || row[0].value == '0') continue; var rank = parseInt(row[0].value); if (row[2].value > 0 && rank <= totalUser * 0.8) { for (var i = 3; i < row.length; i++) if (parseInt(row[i].value) == fullScore[i - 3]) ac[i - 3]++; cnt++; } } for (var pid = 0; pid < fullScore.length; pid++) acRate2[pid] = (ac[pid] / cnt * 100).toFixed(0), ac[pid] = 0; console.log(`${totalUser} |${acRate1.map(x => ` ${x}% |`).join('')}`) console.log(`${totalUser} |${acRate2.map(x => ` ${x}% |`).join('')}`)
-
Accepted Problems
- uoj#P5
- uoj#P264
- uoj#P559
- H1000
- H1005
- H1032
- H1085
- H1087
- SFCR2A
- spoj#KPGAME
- spoj#COT2
- spoj#FN16OIL
- poj#P1000
- loj#P124
- loj#P6062
- loj#P6099
- codeforces#P1513C
- codeforces#P1444C
- codeforces#P1442B
- codeforces#P1385F
- codeforces#P1342E
- codeforces#P1296E2
- codeforces#P1295D
- codeforces#P1292F
- codeforces#P1288E
- codeforces#P1288C
- codeforces#P1284D
- codeforces#P1270C
- codeforces#P1270B
- codeforces#P1265E
- codeforces#P1264C
- codeforces#P1192B
- codeforces#P1151E
- codeforces#P1139E
- codeforces#P1114F
- codeforces#P1096E
- codeforces#P1006F
- codeforces#P983E
- codeforces#P962D
- codeforces#P955C
- codeforces#P940E
- codeforces#P919E
- codeforces#P895E
- codeforces#P870F
- codeforces#P817D
- codeforces#P749E
- codeforces#P704E
- codeforces#P685B
- codeforces#P600E
- codeforces#P553A
- codeforces#P526C
- codeforces#P518D
- codeforces#P494C
- codeforces#P474F
- codeforces#P455A
- codeforces#P438D
- codeforces#P437D
- codeforces#P424E
- codeforces#P396B
- codeforces#P388B
- codeforces#P364D
- codeforces#P340E
- codeforces#P280C
- codeforces#P263D
- codeforces#P209C
- codeforces#P123E
- codeforces#P36E
- codeforces#P11D
- codeforces#P1610G
- codeforces#P1610E
- codeforces#P1638D
- codeforces#P1662F
- codeforces#P1677B
- codeforces#P1716F
- codeforces#P1753B
- codeforces#P1750D
- codeforces#P1748C
- codeforces#P1761D
- codeforces#P1761C
- codeforces#P1763C
- codeforces#P1768E
- codeforces#P1731E
- codeforces#P1731D
- codeforces#P1882E2
- codeforces#P1882E1
- codeforces#P1876C
- codeforces#P1876B
- codeforces#P1884C
- ccf#NOIPS2009C
- ccf#NOIPS2014B
- ccf#NOIPS2016E
- ccf#NOIP2020B
- ccf#NOI2007D
- ccf#NOI2014C
- ccf#CSPS2021B
- ccf#NOIOLPJ2022B
- ccf#CSPS2022A
- ccf#CSPS2022B
- ccf#CSPS2022C
- ccf#NOIP2022A
- ccf#NOIP2022B
- ccf#NOIP2022C
- ccf#267
- luogu#P1020
- luogu#P1073
- luogu#P1102
- luogu#P1122
- luogu#P1365
- luogu#P1396
- luogu#P1527
- luogu#P1850
- luogu#P1983
- luogu#P1989
- luogu#P2081
- luogu#P2375
- luogu#P2473
- luogu#P2590
- luogu#P2610
- luogu#P2664
- luogu#P2723
- luogu#P2824
- luogu#P2827
- luogu#P2986
- luogu#P3157
- luogu#P3200
- luogu#P3203
- luogu#P3239
- luogu#P3320
- luogu#P3390
- luogu#P3488
- luogu#P3498
- luogu#P3521
- luogu#P3627
- luogu#P3806
- luogu#P3810
- luogu#P4103
- luogu#P4130
- luogu#P4145
- luogu#P4147
- luogu#P4168
- luogu#P4178
- luogu#P4183
- luogu#P4211
- luogu#P4318
- luogu#P4363
- luogu#P4416
- luogu#P4556
- luogu#P4660
- luogu#P4696
- luogu#P4737
- luogu#P4749
- luogu#P4777
- luogu#P4921
- luogu#P5014
- luogu#P5298
- luogu#P5494
- luogu#P5921
- luogu#P6137
- luogu#P6173
- luogu#P6227
- luogu#P6477
- luogu#P6486
- luogu#P6628
- luogu#P6753
- luogu#P6773
- luogu#P6875
- luogu#P7114
- luogu#P7165
- luogu#P7219
- luogu#P7876
- luogu#B2002
- luogu#B2027
- luogu#P7914
- luogu#P8010
- luogu#P8255
- luogu#P8819
- luogu#P9070
- luogu#P9169
- luogu#P9450
- bzoj#1000
- bzoj#1036
- bzoj#1076
- bzoj#1168
- bzoj#1217
- bzoj#1419
- bzoj#1485
- bzoj#1493
- bzoj#1907
- bzoj#2002
- bzoj#2288
- bzoj#2314
- bzoj#2427
- bzoj#2574
- bzoj#2639
- bzoj#2657
- bzoj#2724
- bzoj#2733
- bzoj#2818
- bzoj#2878
- bzoj#2935
- bzoj#3039
- bzoj#3211
- bzoj#3262
- bzoj#3295
- bzoj#3307
- bzoj#3611
- bzoj#3626
- bzoj#3670
- bzoj#4355
- bzoj#4552
- bzoj#4612
- bzoj#4721
-
Recent Activities
-
Recent Solutions
-
Stat
-
Rating
Problem Tags
- dp
- 34
- math
- 29
- data structures
- 28
- O2优化
- 22
- greedy
- 16
- combinatorics
- 14
- 线段树
- 13
- number theory
- 13
- implementation
- 12
- dfs and similar
- 11
- graphs
- 11
- probabilities
- 11
- 动态规划
- 11
- constructive algorithms
- 10
- brute force
- 10
- 各省省选
- 10
- 2022
- 9
- trees
- 8
- bitmasks
- 8
- 2020
- 7