QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#136161#5038. CityPetroTarnavskyi#AC ✓1ms3636kbC++17815b2023-08-07 14:35:292023-08-07 14:35:31

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-07 14:35:31]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3636kb
  • [2023-08-07 14:35:29]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	LL ans = 0;
	FOR(dx, 0, n + 1){
		FOR(dy, 0, m + 1){
			if(dx == 0 && dy == 0)
				continue;
				
			if(dx % 2 || dy % 2)
				continue;
			
			int coef = 1;
			if(dx * dy != 0)
				coef = 2;
			ans += coef * (n - dx + 1) * (m - dy + 1);
		}
	}
	cout << ans << endl;
	return 0;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1 1

output:

0

result:

ok 1 number(s): "0"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3424kb

input:

2 3

output:

14

result:

ok 1 number(s): "14"

Test #3:

score: 0
Accepted
time: 1ms
memory: 3420kb

input:

252 139

output:

156806790

result:

ok 1 number(s): "156806790"

Test #4:

score: 0
Accepted
time: 1ms
memory: 3460kb

input:

96 859

output:

869912790

result:

ok 1 number(s): "869912790"

Test #5:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

237 987

output:

6911470020

result:

ok 1 number(s): "6911470020"

Test #6:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

81 411

output:

142652940

result:

ok 1 number(s): "142652940"

Test #7:

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

input:

221 539

output:

1796341860

result:

ok 1 number(s): "1796341860"

Test #8:

score: 0
Accepted
time: 1ms
memory: 3580kb

input:

770 259

output:

5022934670

result:

ok 1 number(s): "5022934670"

Test #9:

score: 0
Accepted
time: 1ms
memory: 3468kb

input:

422 387

output:

3367022678

result:

ok 1 number(s): "3367022678"

Test #10:

score: 0
Accepted
time: 1ms
memory: 3420kb

input:

563 515

output:

10586725560

result:

ok 1 number(s): "10586725560"

Test #11:

score: 0
Accepted
time: 1ms
memory: 3464kb

input:

407 939

output:

18385757040

result:

ok 1 number(s): "18385757040"

Test #12:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

518 518

output:

9069351200

result:

ok 1 number(s): "9069351200"

Test #13:

score: 0
Accepted
time: 1ms
memory: 3416kb

input:

171 646

output:

1547964138

result:

ok 1 number(s): "1547964138"

Test #14:

score: 0
Accepted
time: 0ms
memory: 3460kb

input:

311 70

output:

61339980

result:

ok 1 number(s): "61339980"

Test #15:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

155 494

output:

745330482

result:

ok 1 number(s): "745330482"

Test #16:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

704 918

output:

52470835129

result:

ok 1 number(s): "52470835129"

Test #17:

score: 0
Accepted
time: 1ms
memory: 3416kb

input:

844 46

output:

197229825

result:

ok 1 number(s): "197229825"

Test #18:

score: 0
Accepted
time: 1ms
memory: 3372kb

input:

688 174

output:

1817294209

result:

ok 1 number(s): "1817294209"

Test #19:

score: 0
Accepted
time: 1ms
memory: 3368kb

input:

637 894

output:

40756317888

result:

ok 1 number(s): "40756317888"

Test #20:

score: 0
Accepted
time: 1ms
memory: 3412kb

input:

481 22

output:

15385922

result:

ok 1 number(s): "15385922"

Test #21:

score: 0
Accepted
time: 0ms
memory: 3484kb

input:

1 2

output:

2

result:

ok 1 number(s): "2"

Test #22:

score: 0
Accepted
time: 1ms
memory: 3420kb

input:

1 1000

output:

500000

result:

ok 1 number(s): "500000"

Test #23:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

1000 1000

output:

125500500000

result:

ok 1 number(s): "125500500000"

Test #24:

score: 0
Accepted
time: 1ms
memory: 3536kb

input:

999 1000

output:

125249749500

result:

ok 1 number(s): "125249749500"

Test #25:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

1000 999

output:

125249749500

result:

ok 1 number(s): "125249749500"

Test #26:

score: 0
Accepted
time: 0ms
memory: 3420kb

input:

999 999

output:

124999500000

result:

ok 1 number(s): "124999500000"

Test #27:

score: 0
Accepted
time: 1ms
memory: 3608kb

input:

998 999

output:

124749750500

result:

ok 1 number(s): "124749750500"

Test #28:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

2 1

output:

2

result:

ok 1 number(s): "2"

Test #29:

score: 0
Accepted
time: 1ms
memory: 3424kb

input:

2 2

output:

8

result:

ok 1 number(s): "8"

Test #30:

score: 0
Accepted
time: 1ms
memory: 3580kb

input:

2 1000

output:

1251001

result:

ok 1 number(s): "1251001"