QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#421303#6823. Coffee OverdosekjhhjkiWA 11ms3592kbC++201.2kb2024-05-25 16:16:522024-05-25 16:16:53

Judging History

你现在查看的是最新测评结果

  • [2024-05-25 16:16:53]
  • 评测
  • 测评结果:WA
  • 用时:11ms
  • 内存:3592kb
  • [2024-05-25 16:16:52]
  • 提交

answer

#include <bits/stdc++.h>
#define For(i, a, b) for(i32 i = (a), endi = (b); i <= endi; ++i)
#define foR(i, a, b) for(i32 i = (a), endi = (b); i >= endi; --i)
using namespace std;

template<typename T, typename U>
void chkmin(T &a, U b) { if(a > b) a = b; }
template<typename T, typename U>
void chkmax(T &a, U b) { if(a < b) a = b; }

using i32 = int;
using i64 = long long;
using f64 = long double;

int mp[128];
void init()
{
    For(i, '0', '9') mp[i] = i - '0';
    For(i, 'a', 'z') mp[i] = i - 'a' + 10;
}

void solve()
{
    i32 c, s;
    cin >> s >> c;
    auto get = [s, c](i32 t)
    {
        i64 res = (s + s - t + 2ll) * (t-1) / 2;
        i64 tmp = 0;
        i32 a = s - t + 1, d = c + 1, k = a / d + 1;
        // cout << a << ' ' << d << ' ' << k << '\n';
        tmp = 1ll * (a + (a % d)) * (k) / 2;
        return res + tmp * c;
    };
    i64 ans = max(get(1), (s + 1ll) * s / 2);
    for(i32 i = c; i <= min(c * (c+1ll) / 2, 1ll*s); i += c) chkmax(ans, get(i));
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    init();
    i32 T = 1;
    cin >> T;
    while(T--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3592kb

input:

4
1 2
2 1
10 4
172800 172800

output:

2
3
63
29859840000

result:

ok 4 tokens

Test #2:

score: -100
Wrong Answer
time: 11ms
memory: 3588kb

input:

100000
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 ...

output:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
...

result:

wrong answer 1502nd words differ - expected: '11', found: '10'