-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path597-crossmarket.cpp
More file actions
45 lines (44 loc) · 1.05 KB
/
Copy path597-crossmarket.cpp
File metadata and controls
45 lines (44 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/*
* Crossmarket [1715A]
* Problem: https://codeforces.com/problemset/problem/1715/A
* Verdict: ACCEPTED Solved: 2022-08-20
* Language: C++20 (GCC 11-64)
* Runtime: 15 ms Memory: 0 KB
* Tags: constructive algorithms, greedy, math
* Author: BidoTeima
* Source: https://codeforces.com/contest/1715/submission/169094508
*/
/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc \
int tttttt,subtask; \
cin >> tttttt /*>> subtask*/; \
while (tttttt--)
#define sumrange(l, r, arr) (l == 0 ? arr[r] : arr[r] - arr[l - 1])
#define all(v) v.begin(), v.end()
int main()
{
ACPLS();
tc{
int n,m;
cin>>n>>m;
if(n==1&&n==m)cout<<"0\n";
else cout<<2*min(n,m)+max(n,m)-2<<'\n';
}
}