183642025-10-21 14:02:30ubormaciBuszos kirándulás 2cpp17Accepted 100/1001ms556 KiB
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

set lower bound/upper bound:
 	// . . . m1 . . . d . . . . m2
    auto m1_it = b.lower_bound(d);
    advance(m1_it, -1);
    m1 = *m1_it;
	m2 = *b.upper_bound(d);

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

constexpr auto lcm(auto x, auto... xs)
{
	return ((x = std::lcm(x, xs)), ...);
}

std::gcd(int a, int b)

*/

typedef long long ll;

void solve() {
	ll a, f, m;
	// felnottek szama
	// erdobe menok szama
	// muzeumba menok szama

	cin >> a >> f >> m;

	ll szendvics = 0, viz = 0;

	// az osszes felnott a muzeumba megy
	if(m > a) {
		m -= a;
		szendvics += 3 * a;
		viz += 2 * a;

		szendvics += 2 * m;
		viz += m;

		szendvics += 3 * f;
		viz += f;
	
	}else{

		a -= m;
		szendvics += 3 * m;
		viz += 2 * m;

		f -= a;
		szendvics += 4 * a;
		viz += 2 * a;

		szendvics += 3 * f;
		viz += f;
	}

	cout << szendvics << "\n" << viz;

}

int main()
{
	std::ios_base::sync_with_stdio(false);

	solve();

	return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms500 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted1ms320 KiB
4Accepted1ms316 KiB
5Accepted1ms496 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
subtask330/30
11Accepted1ms320 KiB
12Accepted1ms316 KiB
13Accepted1ms496 KiB
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Accepted1ms316 KiB
17Accepted1ms316 KiB
18Accepted1ms316 KiB
19Accepted1ms316 KiB
20Accepted1ms316 KiB
21Accepted1ms316 KiB
22Accepted1ms316 KiB
23Accepted1ms320 KiB
24Accepted1ms316 KiB
25Accepted1ms500 KiB
26Accepted1ms316 KiB
subtask450/50
27Accepted1ms512 KiB
28Accepted1ms316 KiB
29Accepted1ms320 KiB
30Accepted1ms316 KiB
31Accepted1ms496 KiB
32Accepted1ms316 KiB
33Accepted1ms316 KiB
34Accepted1ms316 KiB
35Accepted1ms316 KiB
36Accepted1ms316 KiB
37Accepted1ms316 KiB
38Accepted1ms316 KiB
39Accepted1ms316 KiB
40Accepted1ms316 KiB
41Accepted1ms320 KiB
42Accepted1ms316 KiB
43Accepted1ms500 KiB
44Accepted1ms316 KiB
45Accepted1ms316 KiB
46Accepted1ms556 KiB
47Accepted1ms316 KiB
48Accepted1ms316 KiB
49Accepted1ms316 KiB
50Accepted1ms316 KiB
51Accepted1ms316 KiB
52Accepted1ms316 KiB