QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#89594 | #5359. 面国建设 | Scintilla | 100 ✓ | 322ms | 6620kb | C++14 | 1.3kb | 2023-03-20 18:46:21 | 2023-03-20 18:46:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl
const int N = 1e6 + 10;
int read() {
int x = 0, f = 1; char c = getchar();
for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
return x * f;
}
void cmin(int &a, int b) { a > b ? a = b : 1; }
void cmax(int &a, int b) { a < b ? a = b : 1; }
int s, c, f[N], g[N];
long long ans;
int main() {
s = read(), c = read() / 2;
rep(i, 0, 2 * s) f[i] = c + 1;
rep(i, 1, c - 1) f[i - 1] = i + 1;
for (int a = 2; a * a <= s; ++ a) {
rep(i, 0, 2 * s) g[i] = f[i];
g[0] = 0;
rep(i, 0, 2 * s) {
if (i >= 2 * a - 1) cmin(g[i], g[i - (2 * a - 1)] + 1);
if (i >= 2 * a * (a - 1)) cmin(f[i], g[i - 2 * a * (a - 1)] + 2 * a);
}
}
rep(i, 0, 2 * s) if (f[i] <= c) {
int cnt = min(s - (f[i] + i) / 2 + 1, (c - f[i]) / 2 + 1);
if (cnt >= 0) ans += cnt;
}
printf("%lld\n", ans);
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 6
Accepted
Test #1:
score: 6
Accepted
time: 2ms
memory: 3448kb
input:
4 10
output:
7
result:
ok single line: '7'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3388kb
input:
7 2
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
6 6
output:
2
result:
ok single line: '2'
Test #4:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
10 7
output:
2
result:
ok single line: '2'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3456kb
input:
8 10
output:
8
result:
ok single line: '8'
Test #6:
score: 0
Accepted
time: 2ms
memory: 3384kb
input:
10 8
output:
5
result:
ok single line: '5'
Subtask #2:
score: 12
Accepted
Dependency #1:
100%
Accepted
Test #7:
score: 12
Accepted
time: 3ms
memory: 3496kb
input:
399 994
output:
125266
result:
ok single line: '125266'
Test #8:
score: 0
Accepted
time: 2ms
memory: 3432kb
input:
742 645
output:
184225
result:
ok single line: '184225'
Test #9:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
932 900
output:
328424
result:
ok single line: '328424'
Test #10:
score: 0
Accepted
time: 2ms
memory: 3456kb
input:
943 971
output:
357500
result:
ok single line: '357500'
Test #11:
score: 0
Accepted
time: 2ms
memory: 3456kb
input:
955 897
output:
335817
result:
ok single line: '335817'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
903 971
output:
340678
result:
ok single line: '340678'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
954 978
output:
364964
result:
ok single line: '364964'
Test #14:
score: 0
Accepted
time: 2ms
memory: 3588kb
input:
908 902
output:
319849
result:
ok single line: '319849'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
934 908
output:
332030
result:
ok single line: '332030'
Test #16:
score: 0
Accepted
time: 2ms
memory: 3672kb
input:
961 924
output:
348391
result:
ok single line: '348391'
Subtask #3:
score: 31
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Test #17:
score: 31
Accepted
time: 2ms
memory: 3692kb
input:
1951 2977
output:
2228950
result:
ok single line: '2228950'
Test #18:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
4626 5415
output:
10254469
result:
ok single line: '10254469'
Test #19:
score: 0
Accepted
time: 4ms
memory: 3476kb
input:
5983 4766
output:
12197679
result:
ok single line: '12197679'
Test #20:
score: 0
Accepted
time: 3ms
memory: 3500kb
input:
5094 5425
output:
11472637
result:
ok single line: '11472637'
Test #21:
score: 0
Accepted
time: 2ms
memory: 3544kb
input:
5598 4989
output:
11826716
result:
ok single line: '11826716'
Test #22:
score: 0
Accepted
time: 3ms
memory: 3544kb
input:
5577 5188
output:
12208146
result:
ok single line: '12208146'
Test #23:
score: 0
Accepted
time: 3ms
memory: 3448kb
input:
5688 5804
output:
13807758
result:
ok single line: '13807758'
Test #24:
score: 0
Accepted
time: 3ms
memory: 3688kb
input:
5856 5309
output:
13161066
result:
ok single line: '13161066'
Test #25:
score: 0
Accepted
time: 3ms
memory: 3508kb
input:
5378 5859
output:
13061554
result:
ok single line: '13061554'
Test #26:
score: 0
Accepted
time: 2ms
memory: 3692kb
input:
5729 5635
output:
13554877
result:
ok single line: '13554877'
Subtask #4:
score: 51
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Test #27:
score: 51
Accepted
time: 271ms
memory: 6376kb
input:
177004 361104
output:
23708315017
result:
ok single line: '23708315017'
Test #28:
score: 0
Accepted
time: 245ms
memory: 6196kb
input:
165955 330686
output:
20513788444
result:
ok single line: '20513788444'
Test #29:
score: 0
Accepted
time: 312ms
memory: 6528kb
input:
196341 379690
output:
28146877343
result:
ok single line: '28146877343'
Test #30:
score: 0
Accepted
time: 218ms
memory: 5920kb
input:
157573 352489
output:
19921485073
result:
ok single line: '19921485073'
Test #31:
score: 0
Accepted
time: 275ms
memory: 6172kb
input:
174981 388787
output:
24469285862
result:
ok single line: '24469285862'
Test #32:
score: 0
Accepted
time: 274ms
memory: 6224kb
input:
179053 386583
output:
25166888234
result:
ok single line: '25166888234'
Test #33:
score: 0
Accepted
time: 284ms
memory: 6412kb
input:
181239 344051
output:
23675514126
result:
ok single line: '23675514126'
Test #34:
score: 0
Accepted
time: 307ms
memory: 6620kb
input:
194920 395575
output:
28656790378
result:
ok single line: '28656790378'
Test #35:
score: 0
Accepted
time: 271ms
memory: 6252kb
input:
179011 399658
output:
25686628463
result:
ok single line: '25686628463'
Test #36:
score: 0
Accepted
time: 277ms
memory: 6528kb
input:
183359 394921
output:
26352667541
result:
ok single line: '26352667541'
Test #37:
score: 0
Accepted
time: 312ms
memory: 6412kb
input:
195360 389377
output:
28442072522
result:
ok single line: '28442072522'
Test #38:
score: 0
Accepted
time: 297ms
memory: 6596kb
input:
191706 397710
output:
28122791775
result:
ok single line: '28122791775'
Test #39:
score: 0
Accepted
time: 297ms
memory: 6444kb
input:
191762 396427
output:
28074496102
result:
ok single line: '28074496102'
Test #40:
score: 0
Accepted
time: 322ms
memory: 6544kb
input:
197603 386515
output:
28732769430
result:
ok single line: '28732769430'
Test #41:
score: 0
Accepted
time: 288ms
memory: 6396kb
input:
190189 377777
output:
26893005583
result:
ok single line: '26893005583'
Test #42:
score: 0
Accepted
time: 296ms
memory: 6328kb
input:
189770 391031
output:
27434979251
result:
ok single line: '27434979251'
Test #43:
score: 0
Accepted
time: 304ms
memory: 6612kb
input:
194039 389514
output:
28192735947
result:
ok single line: '28192735947'
Test #44:
score: 0
Accepted
time: 312ms
memory: 6508kb
input:
197815 388430
output:
28870257334
result:
ok single line: '28870257334'
Test #45:
score: 0
Accepted
time: 290ms
memory: 6348kb
input:
189687 383322
output:
27060812973
result:
ok single line: '27060812973'
Test #46:
score: 0
Accepted
time: 311ms
memory: 6448kb
input:
196059 391296
output:
28672072117
result:
ok single line: '28672072117'