QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#398353#3768. 矩形并Hjcc#AC ✓4ms3712kbC++141.3kb2024-04-25 11:03:232024-04-25 11:03:24

Judging History

This is the latest submission verdict.

  • [2024-04-25 11:03:24]
  • Judged
  • Verdict: AC
  • Time: 4ms
  • Memory: 3712kb
  • [2024-04-25 11:03:23]
  • Submitted

answer

# include <bits/stdc++.h>
# define ll long long

using namespace std;

ll a, b, __, _, ___, ____;
const ll mod = 1e9 + 7;

int main() {
# ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
# endif
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  while (cin >> a >> b >> __ >> ___ >> _ >> ____) {
    ll cs, s = ((___ - __) * (____ - _) % mod * a % mod * b % mod + (a * (a + 1) / 2 % mod) * (b * (b + 1) / 2 % mod) % mod) % mod;
    if (a <= __ || b <= _) {
      cs = 0;
    } else {
      ___ = min(___, a), ____ = min(____, b);
      cs = (((___ - __) * (___ - __ - 1) / 2 % mod) * ((____ - _) * (____ - _ - 1) / 2 % mod) % mod + (___ - __) * (___ - __ - 1) / 2 % mod * (____ - _) % mod * (b - ____ + 1) % mod + (____ - _) * (____ - _ - 1) / 2 % mod * (___ - __) % mod * (a - ___ + 1) % mod + (___ - __) * (____ - _) % mod * (a - ___ + 1) % mod * (b - ____ + 1) % mod) % mod;
      /*
      ((___ - __) * (___ - __ - 1) / 2 % mod) * ((____ - _) * (____ - _ - 1) / 2 % mod) % mod
      (___ - __) * (___ - __ - 1) % mod * (____ - _) % mod * (b - ____ + 1) % mod
      (____ - _) * (____ - _ - 1) % mod * (___ - __) % mod * (a - ___ + 1) % mod
      (___ - __) * (____ - _) % mod * (a - ___ + 1) % mod * (b - ____ + 1) % mod
      */
    }
    cout << (s + mod - cs) % mod << '\n';
  }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 4ms
memory: 3712kb

input:

1 1
2 3 2 3
10 10
1 5 1 5
1000000000 1000000000
1 1000000000 1 1000000000
1 2
2 5 1 4
2 5
1 5 2 4
1 4
3 4 1 5
2 3
1 4 2 4
5 3
1 4 1 2
5 2
3 5 4 5
3 2
3 5 1 4
5 3
4 5 1 3
5 5
1 5 2 5
4 4
1 5 2 5
1 2
1 5 3 5
3 4
3 4 1 2
2 2
1 4 1 3
3 1
1 4 1 4
2 4
1 5 2 5
4 2
2 3 3 5
1 3
1 2 1 2
2 4
1 3 1 5
5 2
2 3 2 ...

output:

2
3725
2793
21
120
26
53
117
65
54
117
465
274
19
72
32
33
123
46
9
88
65
36
252
83
159
17
330
261
186
84
26
45
34
75
34
65
30
88
107
12
105
38
46
15
85
29
55
78
55
96
17
39
60
20
17
56
45
5
18
96
30
25
108
146
114
65
19
192
51
17
42
54
132
110
75
42
75
66
150
7
7
173
33
95
75
294
45
247
25
35
110
2...

result:

ok 10000 lines