GCC Code Coverage Report


Directory: ./
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 100.0% 16 / 0 / 16
Functions: 100.0% 1 / 0 / 1
Branches: 59.4% 19 / 0 / 32

test/cpv/library-checker-geo/furthest_pair.cpp
Line Branch Exec Source
1 // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/furthest_pair
2 #include "../../../src/geo2d/ds/cvh/lib.hpp"
3
4 using namespace tifa_libs;
5 using point_t = point<f128>;
6 using cvh_t = cvh<f128>;
7
8 46 int main() {
9
1/2
✓ Branch 2 taken 46 times.
✗ Branch 3 not taken.
46 std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);
10 u32 t;
11
1/2
✓ Branch 1 taken 46 times.
✗ Branch 2 not taken.
46 std::cin >> t;
12
2/2
✓ Branch 0 taken 366423 times.
✓ Branch 1 taken 46 times.
366469 while (t--) {
13 u32 n;
14
1/2
✓ Branch 1 taken 366423 times.
✗ Branch 2 not taken.
366423 std::cin >> n;
15 366423 cvh_t poly(n);
16 366423 std::cin >> poly;
17
1/2
✓ Branch 1 taken 366423 times.
✗ Branch 2 not taken.
366423 map<point_t, vecu> mp;
18
4/6
✓ Branch 2 taken 21997481 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 21997481 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 21997481 times.
✓ Branch 8 taken 366423 times.
22363904 flt_ (u32, i, 0, n) mp[poly.vs[i]].push_back(i);
19 366423 poly.init();
20 366423 auto [dis, i, j] = poly.template diameter<true>();
21
2/4
✓ Branch 2 taken 366423 times.
✗ Branch 3 not taken.
✓ Branch 7 taken 366423 times.
✗ Branch 8 not taken.
366423 u32 l = mp[poly.vs[i]][0], r = mp[poly.vs[j]][0];
22
3/4
✓ Branch 0 taken 348 times.
✓ Branch 1 taken 366075 times.
✓ Branch 4 taken 348 times.
✗ Branch 5 not taken.
366423 if (l == r) r = mp[poly.vs[j]][1];
23
4/8
✓ Branch 1 taken 366423 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 366423 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 366423 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 366423 times.
✗ Branch 11 not taken.
366423 std::cout << l << ' ' << r << '\n';
24 366423 }
25 46 return 0;
26 }
27