QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#199611 | #5038. City | vanthoci# | AC ✓ | 1ms | 4016kb | C++17 | 1.2kb | 2023-10-04 13:18:22 | 2023-10-04 13:18:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
template<class A> string to_string(A v) {
string res = "{";
for (const auto &x: v) res += to_string(x) + ", ";
return res.substr(0, res.size() - 2) + "}";
}
void debug_out() { cerr << "\n"; }
template<class H, class... T> void debug_out(H h, T... t) {
cerr << " " << to_string(h); debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] : "; debug_out(__VA_ARGS__)
#define Time_Start clock_t start = clock()
#define Time_End clock_t end = clock();\
double time_elapsed = (double)(end - start) / CLOCKS_PER_SEC;\
cerr << "time elapsed :" << time_elapsed << "s\n"
void solve() {
int n, m;
cin >> n >> m;
i64 res=0;
for(int i=1;i<=n+1;i++){
for(int j=1;j<=m+1;j++){
i64 up=i-1,down=n+1-i,r=m+1-j;
up/=2,down/=2,r/=2;
// cout<<up<<" "<<down<<" "<<r<<" "<<(up+down+1)*(r+1)-1<<endl;
res+=(up+down+1)*(r+1)-1;
res-=up;
}
}
cout<<res<<'\n';
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
Time_Start;
int T; T = 1;
// cin >> T;
while (T--) solve();
Time_End;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4016kb
input:
1 1
output:
0
result:
ok 1 number(s): "0"
Test #2:
score: 0
Accepted
time: 0ms
memory: 4016kb
input:
2 3
output:
14
result:
ok 1 number(s): "14"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3976kb
input:
252 139
output:
156806790
result:
ok 1 number(s): "156806790"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3988kb
input:
96 859
output:
869912790
result:
ok 1 number(s): "869912790"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
237 987
output:
6911470020
result:
ok 1 number(s): "6911470020"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
81 411
output:
142652940
result:
ok 1 number(s): "142652940"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
221 539
output:
1796341860
result:
ok 1 number(s): "1796341860"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
770 259
output:
5022934670
result:
ok 1 number(s): "5022934670"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
422 387
output:
3367022678
result:
ok 1 number(s): "3367022678"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3964kb
input:
563 515
output:
10586725560
result:
ok 1 number(s): "10586725560"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
407 939
output:
18385757040
result:
ok 1 number(s): "18385757040"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
518 518
output:
9069351200
result:
ok 1 number(s): "9069351200"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
171 646
output:
1547964138
result:
ok 1 number(s): "1547964138"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
311 70
output:
61339980
result:
ok 1 number(s): "61339980"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3976kb
input:
155 494
output:
745330482
result:
ok 1 number(s): "745330482"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3988kb
input:
704 918
output:
52470835129
result:
ok 1 number(s): "52470835129"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3960kb
input:
844 46
output:
197229825
result:
ok 1 number(s): "197229825"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
688 174
output:
1817294209
result:
ok 1 number(s): "1817294209"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
637 894
output:
40756317888
result:
ok 1 number(s): "40756317888"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
481 22
output:
15385922
result:
ok 1 number(s): "15385922"
Test #21:
score: 0
Accepted
time: 0ms
memory: 3920kb
input:
1 2
output:
2
result:
ok 1 number(s): "2"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
1 1000
output:
500000
result:
ok 1 number(s): "500000"
Test #23:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
1000 1000
output:
125500500000
result:
ok 1 number(s): "125500500000"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
999 1000
output:
125249749500
result:
ok 1 number(s): "125249749500"
Test #25:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
1000 999
output:
125249749500
result:
ok 1 number(s): "125249749500"
Test #26:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
999 999
output:
124999500000
result:
ok 1 number(s): "124999500000"
Test #27:
score: 0
Accepted
time: 1ms
memory: 3972kb
input:
998 999
output:
124749750500
result:
ok 1 number(s): "124749750500"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
2 1
output:
2
result:
ok 1 number(s): "2"
Test #29:
score: 0
Accepted
time: 0ms
memory: 3928kb
input:
2 2
output:
8
result:
ok 1 number(s): "8"
Test #30:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
2 1000
output:
1251001
result:
ok 1 number(s): "1251001"