oj.uz

답안 #35382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
35382 2017-11-21T14:28:11 Z RockyB Košnja (COCI17_kosnja) C++14
50 / 50
 86 ms 2016 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int k;
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	cin >> k;
	while (k--) {
		int a, b;
		cin >> a >> b;
		cout << (min(a, b) - 1) * 2 << nl;
	}
	ioi
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 43 ms 2016 KB Output is correct
7 Correct 86 ms 2016 KB Output is correct
8 Correct 66 ms 2016 KB Output is correct
9 Correct 79 ms 2016 KB Output is correct
10 Correct 76 ms 2016 KB Output is correct