load all div 3 contests

This commit is contained in:
Barrett Ruth 2025-12-04 19:40:56 -05:00
parent cdf73b9909
commit 52068dbf9a
581 changed files with 2846 additions and 472 deletions

72
codeforces/540/1118a.cc Normal file
View file

@ -0,0 +1,72 @@
#include <bits/stdc++.h> // {{{
#include <version>
#ifdef __cpp_lib_ranges_enumerate
#include <ranges>
namespace rv = std::views;
namespace rs = std::ranges;
#endif
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using f128 = long double;
#if __cplusplus >= 202002L
template <typename T>
constexpr T MIN = std::numeric_limits<T>::min();
template <typename T>
constexpr T MAX = std::numeric_limits<T>::max();
#endif
#ifdef LOCAL
#define db(...) std::print(__VA_ARGS__)
#define dbln(...) std::println(__VA_ARGS__)
#else
#define db(...)
#define dbln(...)
#endif
// }}}
void solve() {
u64 n, a, b;
cin >> n >> a >> b;
u64 ans;
if (2 * a > b) {
ans = n / 2 * b + a * (n & 1);
} else {
ans = n * a;
}
println("{}", ans);
}
int main() { // {{{
std::cin.exceptions(std::cin.failbit);
#ifdef LOCAL
std::cerr.rdbuf(std::cout.rdbuf());
std::cout.setf(std::ios::unitbuf);
std::cerr.setf(std::ios::unitbuf);
#else
std::cin.tie(nullptr)->sync_with_stdio(false);
#endif
u32 tc = 1;
std::cin >> tc;
for (u32 t = 0; t < tc; ++t) {
solve();
}
return 0;
}
// }}}

View file

@ -0,0 +1,5 @@
4
10 1 3
7 3 2
1 1000 1
1000000000000 42 88

View file

@ -0,0 +1,4 @@
10
9
1000
42000000000000

View file

@ -0,0 +1,2 @@
7
5 5 4 5 5 5 6

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
8
4 8 8 7 8 4 4 5

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
9
2 3 4 2 2 3 2 2 4

View file

@ -0,0 +1 @@
3

View file

@ -0,0 +1,2 @@
4
1 8 8 1 2 2 2 2 2 2 2 2 1 8 8 1

View file

@ -0,0 +1,5 @@
YES
1 2 2 1
8 2 2 8
8 2 2 8
1 2 2 1

View file

@ -0,0 +1,2 @@
3
1 1 1 1 1 3 3 3 3

View file

@ -0,0 +1,4 @@
YES
1 3 1
3 1 3
1 3 1

View file

@ -0,0 +1,2 @@
4
1 2 1 9 8 4 3 8 8 3 4 8 9 2 1 1

View file

@ -0,0 +1 @@
NO

View file

@ -0,0 +1,2 @@
1
10

View file

@ -0,0 +1,2 @@
YES
10

View file

@ -0,0 +1,2 @@
5 8
2 3 1 1 2

View file

@ -0,0 +1 @@
4

View file

@ -0,0 +1,2 @@
7 10
1 3 4 2 1 4 2

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
5 15
5 5 5 5 5

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,2 @@
5 16
5 5 5 5 5

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
5 26
5 5 5 5 5

View file

@ -0,0 +1 @@
-1

View file

@ -0,0 +1,2 @@
5 8
2 3 1 1 2

View file

@ -0,0 +1 @@
4

View file

@ -0,0 +1,2 @@
7 10
1 3 4 2 1 4 2

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
5 15
5 5 5 5 5

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,2 @@
5 16
5 5 5 5 5

View file

@ -0,0 +1 @@
2

View file

@ -0,0 +1,2 @@
5 26
5 5 5 5 5

View file

@ -0,0 +1 @@
-1

View file

@ -0,0 +1 @@
4 3

View file

@ -0,0 +1,5 @@
YES
3 1
1 3
3 2
2 3

View file

@ -0,0 +1 @@
10 4

View file

@ -0,0 +1,11 @@
YES
2 1
1 3
4 2
3 4
4 3
3 2
2 4
4 1
1 4
3 1

View file

@ -0,0 +1 @@
13 4

View file

@ -0,0 +1 @@
NO

View file

@ -0,0 +1,6 @@
5
2 0 0 1 2
1 2
2 3
2 4
2 5

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,6 @@
5
1 0 0 0 2
1 2
2 3
3 4
4 5

View file

@ -0,0 +1 @@
4

View file

@ -0,0 +1,4 @@
3
1 1 2
2 3
1 3

View file

@ -0,0 +1 @@
0

View file

@ -0,0 +1,6 @@
5 2
2 0 0 1 2
1 2
2 3
2 4
2 5

View file

@ -0,0 +1 @@
1

View file

@ -0,0 +1,8 @@
7 3
0 1 0 2 2 3 0
1 3
1 4
1 5
2 7
3 6
4 7

View file

@ -0,0 +1 @@
4