QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #858026 | #9675. 电池检测 | xyz123 | 10 | 10ms | 22352kb | C++23 | 1.5kb | 2025-01-16 13:07:56 | 2025-01-16 13:07:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(20071211);
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],st[1000001],u[1000001];
char s[1000001];
struct p{long long q,w;}l[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
int main()
{
// freopen("1.in","r",stdin);
fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
T=1;
scanf("%lld",&T);
for(int ii=1;ii<=T;ii++)
{
scanf("%lld%lld",&a,&b);
long long gg=a-2;
if(gg>=b)
{
printf("%lld\n",b+1);
continue;
}
an=(a+gg)*(b-gg)+(b-gg)*(b-gg-1)/2;
an=an+gg+1;
// if(a>=b+2)
// {
// an=min(an,b+1);
// }
printf("%lld\n",an);
}
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 10ms
memory: 22348kb
input:
3 2 1 3 1 2 2
output:
3 2 6
result:
ok 3 number(s): "3 2 6"
Test #2:
score: 0
Wrong Answer
time: 8ms
memory: 20300kb
input:
12 2 1 2 2 2 3 2 4 3 1 3 2 3 3 3 4 4 1 4 2 4 3 4 4
output:
3 6 10 15 2 6 11 17 2 3 9 16
result:
wrong answer 6th numbers differ - expected: '4', found: '6'
Subtask #2:
score: 5
Accepted
Test #3:
score: 5
Accepted
time: 9ms
memory: 22352kb
input:
1000 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 2 25 2 26 2 27 2 28 2 29 2 30 2 31 2 32 2 33 2 34 2 35 2 36 2 37 2 38 2 39 2 40 2 41 2 42 2 43 2 44 2 45 2 46 2 47 2 48 2 49 2 50 2 51 2 52 2 53 2 54 2 55 2 56 2 57 2 58 2 59 2 60 2 61...
output:
3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276 300 325 351 378 406 435 465 496 528 561 595 630 666 703 741 780 820 861 903 946 990 1035 1081 1128 1176 1225 1275 1326 1378 1431 1485 1540 1596 1653 1711 1770 1830 1891 1953 2016 2080 2145 2211 2278 2346 2415 2485 2556 2628 27...
result:
ok 1000 numbers
Subtask #3:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 10ms
memory: 22352kb
input:
1000 3 1 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 3 21 3 22 3 23 3 24 3 25 3 26 3 27 3 28 3 29 3 30 3 31 3 32 3 33 3 34 3 35 3 36 3 37 3 38 3 39 3 40 3 41 3 42 3 43 3 44 3 45 3 46 3 47 3 48 3 49 3 50 3 51 3 52 3 53 3 54 3 55 3 56 3 57 3 58 3 59 3 60 3 61...
output:
2 6 11 17 24 32 41 51 62 74 87 101 116 132 149 167 186 206 227 249 272 296 321 347 374 402 431 461 492 524 557 591 626 662 699 737 776 816 857 899 942 986 1031 1077 1124 1172 1221 1271 1322 1374 1427 1481 1536 1592 1649 1707 1766 1826 1887 1949 2012 2076 2141 2207 2274 2342 2411 2481 2552 2624 2697 ...
result:
wrong answer 2nd numbers differ - expected: '4', found: '6'
Subtask #4:
score: 5
Accepted
Test #5:
score: 5
Accepted
time: 7ms
memory: 20172kb
input:
1000 907 241 495 435 227 139 616 1 433 35 588 407 533 322 995 961 748 310 212 36 968 500 294 187 375 371 307 14 648 180 122 28 304 253 818 812 41 5 286 62 573 340 547 224 347 35 279 56 151 85 626 410 456 248 578 470 11 6 952 771 404 302 77 27 168 40 524 517 171 147 407 294 268 106 100 27 549 196 973...
output:
242 436 140 2 36 408 323 962 311 37 501 188 372 15 181 29 254 813 6 63 341 225 36 57 86 411 249 471 7 772 303 28 41 518 148 295 107 28 197 374 35 337 236 92 714 832 465 377 70 496 141 52 38 47 632 355 96 329 130 395 233 124 815 408 201 20 56 630 544 62 379 618 415 17 131 265 179 232 316 109 60 266 7...
result:
ok 1000 numbers
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Skipped
Dependency #1:
0%