Submission #213465
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <cfloat> #include <ctime> #include <cassert> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> #include <numeric> #include <list> #include <iomanip> #include <fstream> #include <bitset> using namespace std; #define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it) template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } } template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; } template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; } template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; } template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; } #define dump(v) (cerr << #v << ": " << v << endl) #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define erep(i, n) for (int i = 0; i <= (int)(n); ++i) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() #define clr(a, x) memset(a, x, sizeof(a)) #define sz(a) ((int)(a).size()) #define mp(a, b) make_pair(a, b) #define ten(n) ((long long)(1e##n)) template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); } template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); } template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); } template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); } template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; } void fast_io() { cin.tie(0); ios::sync_with_stdio(false); } bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; } typedef long long ll; typedef pair<int, int> pint; const int dx[] = { 0, 1, 0, -1 }; const int dy[] = { 1, 0, -1, 0 }; int main() { int a, b; cin >> a >> b; if (a > b) swap(a, b); cout << min(b - a, a + (10 - b)) << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 錠 |
User | takapt |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 3374 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 928 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 0_1.txt, 0_2.txt, 0_3.txt, 0_4.txt, 0_5.txt, 0_6.txt, 0_7.txt, 0_8.txt, 0_9.txt, 1_0.txt, 1_2.txt, 1_3.txt, 1_4.txt, 1_5.txt, 1_6.txt, 1_7.txt, 1_8.txt, 1_9.txt, 2_0.txt, 2_1.txt, 2_3.txt, 2_4.txt, 2_5.txt, 2_6.txt, 2_7.txt, 2_8.txt, 2_9.txt, 3_0.txt, 3_1.txt, 3_2.txt, 3_4.txt, 3_5.txt, 3_6.txt, 3_7.txt, 3_8.txt, 3_9.txt, 4_0.txt, 4_1.txt, 4_2.txt, 4_3.txt, 4_5.txt, 4_6.txt, 4_7.txt, 4_8.txt, 4_9.txt, 5_0.txt, 5_1.txt, 5_2.txt, 5_3.txt, 5_4.txt, 5_6.txt, 5_7.txt, 5_8.txt, 5_9.txt, 6_0.txt, 6_1.txt, 6_2.txt, 6_3.txt, 6_4.txt, 6_5.txt, 6_7.txt, 6_8.txt, 6_9.txt, 7_0.txt, 7_1.txt, 7_2.txt, 7_3.txt, 7_4.txt, 7_5.txt, 7_6.txt, 7_8.txt, 7_9.txt, 8_0.txt, 8_1.txt, 8_2.txt, 8_3.txt, 8_4.txt, 8_5.txt, 8_6.txt, 8_7.txt, 8_9.txt, 9_0.txt, 9_1.txt, 9_2.txt, 9_3.txt, 9_4.txt, 9_5.txt, 9_6.txt, 9_7.txt, 9_8.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_1.txt | AC | 21 ms | 800 KB |
0_2.txt | AC | 21 ms | 920 KB |
0_3.txt | AC | 20 ms | 796 KB |
0_4.txt | AC | 21 ms | 800 KB |
0_5.txt | AC | 22 ms | 924 KB |
0_6.txt | AC | 21 ms | 672 KB |
0_7.txt | AC | 21 ms | 800 KB |
0_8.txt | AC | 21 ms | 800 KB |
0_9.txt | AC | 22 ms | 928 KB |
1_0.txt | AC | 21 ms | 672 KB |
1_2.txt | AC | 22 ms | 800 KB |
1_3.txt | AC | 21 ms | 920 KB |
1_4.txt | AC | 22 ms | 804 KB |
1_5.txt | AC | 22 ms | 800 KB |
1_6.txt | AC | 21 ms | 676 KB |
1_7.txt | AC | 21 ms | 796 KB |
1_8.txt | AC | 21 ms | 676 KB |
1_9.txt | AC | 21 ms | 796 KB |
2_0.txt | AC | 20 ms | 924 KB |
2_1.txt | AC | 21 ms | 796 KB |
2_3.txt | AC | 21 ms | 804 KB |
2_4.txt | AC | 20 ms | 800 KB |
2_5.txt | AC | 21 ms | 924 KB |
2_6.txt | AC | 21 ms | 800 KB |
2_7.txt | AC | 20 ms | 800 KB |
2_8.txt | AC | 20 ms | 792 KB |
2_9.txt | AC | 21 ms | 920 KB |
3_0.txt | AC | 22 ms | 800 KB |
3_1.txt | AC | 20 ms | 792 KB |
3_2.txt | AC | 20 ms | 796 KB |
3_4.txt | AC | 21 ms | 796 KB |
3_5.txt | AC | 21 ms | 796 KB |
3_6.txt | AC | 20 ms | 916 KB |
3_7.txt | AC | 20 ms | 804 KB |
3_8.txt | AC | 20 ms | 800 KB |
3_9.txt | AC | 21 ms | 804 KB |
4_0.txt | AC | 22 ms | 800 KB |
4_1.txt | AC | 21 ms | 800 KB |
4_2.txt | AC | 21 ms | 804 KB |
4_3.txt | AC | 21 ms | 800 KB |
4_5.txt | AC | 21 ms | 732 KB |
4_6.txt | AC | 19 ms | 672 KB |
4_7.txt | AC | 22 ms | 700 KB |
4_8.txt | AC | 21 ms | 800 KB |
4_9.txt | AC | 20 ms | 748 KB |
5_0.txt | AC | 22 ms | 928 KB |
5_1.txt | AC | 20 ms | 796 KB |
5_2.txt | AC | 20 ms | 672 KB |
5_3.txt | AC | 20 ms | 920 KB |
5_4.txt | AC | 20 ms | 672 KB |
5_6.txt | AC | 21 ms | 800 KB |
5_7.txt | AC | 21 ms | 796 KB |
5_8.txt | AC | 20 ms | 672 KB |
5_9.txt | AC | 22 ms | 800 KB |
6_0.txt | AC | 21 ms | 672 KB |
6_1.txt | AC | 21 ms | 700 KB |
6_2.txt | AC | 22 ms | 924 KB |
6_3.txt | AC | 21 ms | 924 KB |
6_4.txt | AC | 20 ms | 800 KB |
6_5.txt | AC | 20 ms | 924 KB |
6_7.txt | AC | 20 ms | 804 KB |
6_8.txt | AC | 21 ms | 804 KB |
6_9.txt | AC | 20 ms | 804 KB |
7_0.txt | AC | 21 ms | 804 KB |
7_1.txt | AC | 21 ms | 676 KB |
7_2.txt | AC | 21 ms | 800 KB |
7_3.txt | AC | 21 ms | 700 KB |
7_4.txt | AC | 21 ms | 804 KB |
7_5.txt | AC | 21 ms | 800 KB |
7_6.txt | AC | 21 ms | 800 KB |
7_8.txt | AC | 21 ms | 924 KB |
7_9.txt | AC | 21 ms | 704 KB |
8_0.txt | AC | 20 ms | 800 KB |
8_1.txt | AC | 21 ms | 924 KB |
8_2.txt | AC | 21 ms | 800 KB |
8_3.txt | AC | 21 ms | 736 KB |
8_4.txt | AC | 21 ms | 804 KB |
8_5.txt | AC | 21 ms | 804 KB |
8_6.txt | AC | 21 ms | 676 KB |
8_7.txt | AC | 21 ms | 676 KB |
8_9.txt | AC | 21 ms | 924 KB |
9_0.txt | AC | 20 ms | 676 KB |
9_1.txt | AC | 21 ms | 928 KB |
9_2.txt | AC | 21 ms | 800 KB |
9_3.txt | AC | 23 ms | 748 KB |
9_4.txt | AC | 20 ms | 800 KB |
9_5.txt | AC | 20 ms | 704 KB |
9_6.txt | AC | 20 ms | 796 KB |
9_7.txt | AC | 21 ms | 924 KB |
9_8.txt | AC | 21 ms | 804 KB |