Submission #812693
Source Code Expand
#include <algorithm> #include <cmath> #include <cstdlib>//atof/atoi/atol/atoll/strtod/strtof/..., srand/rand, calloc/malloc, exit, qsort, abs #include <iomanip> #include <iostream> #include <iterator> #include <queue> #include <string> #include <tuple> #include <utility> #include <vector> #define PRIME 1000000007 using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, int> plli; typedef pair<double, int> pdi; typedef pair<ll, ll> pllll; typedef pair<double, double> pdd; int ipow(int base, int exp); int left(int current, bool swap); int right(int current, bool swap); int main(void){ int a, b, c, d, e, f, g, h; cin >> a; if (a < 100) { cout << "00" << endl; return 0; } if (a > 70000) { cout << "89" << endl; return 0; } if (a <= 5000) { a /= 100; if (a / 10 == 0) { cout << "0" << a << endl; } else { cout << a << endl; } return 0; } if (a >= 35000) { cout << ((a - 30000) / 5000 + 80) << endl; return 0; } if (a <= 30000) { cout << (a/1000 + 50) << endl; return 0; } } int ipow(int base, int exp) { int result = 1; while (exp) { if (exp & 1) result *= base; exp >>= 1; base *= base; } return result; } int left(int current, bool swap = false){ if(swap){ return right(current, false); } else { return 2*current + 1; } } int right(int current, bool swap = false){ if(swap){ return left(current, false); } else { return 2*(current+1); } }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | L3Sota |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1629 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 928 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 25 ms | 740 KB |
00_sample_02.txt | AC | 29 ms | 800 KB |
00_sample_03.txt | AC | 27 ms | 696 KB |
test_01.txt | AC | 26 ms | 804 KB |
test_02.txt | AC | 26 ms | 924 KB |
test_03.txt | AC | 25 ms | 800 KB |
test_04.txt | AC | 25 ms | 928 KB |
test_05.txt | AC | 25 ms | 676 KB |
test_06.txt | AC | 26 ms | 928 KB |
test_07.txt | AC | 24 ms | 924 KB |
test_08.txt | AC | 25 ms | 680 KB |
test_09.txt | AC | 26 ms | 732 KB |
test_10.txt | AC | 25 ms | 780 KB |
test_11.txt | AC | 25 ms | 804 KB |
test_12.txt | AC | 27 ms | 676 KB |
test_13.txt | AC | 28 ms | 800 KB |
test_14.txt | AC | 25 ms | 676 KB |
test_15.txt | AC | 29 ms | 676 KB |
test_16.txt | AC | 25 ms | 800 KB |
test_17.txt | AC | 27 ms | 808 KB |
test_18.txt | AC | 27 ms | 808 KB |
test_19.txt | AC | 27 ms | 800 KB |
test_20.txt | AC | 27 ms | 800 KB |
test_21.txt | AC | 28 ms | 676 KB |
test_22.txt | AC | 25 ms | 672 KB |
test_23.txt | AC | 27 ms | 804 KB |
test_24.txt | AC | 27 ms | 676 KB |
test_25.txt | AC | 27 ms | 676 KB |
test_26.txt | AC | 27 ms | 680 KB |
test_27.txt | AC | 27 ms | 804 KB |
test_28.txt | AC | 25 ms | 804 KB |
test_29.txt | AC | 27 ms | 804 KB |
test_30.txt | AC | 27 ms | 800 KB |
test_31.txt | AC | 26 ms | 676 KB |
test_32.txt | AC | 26 ms | 676 KB |
test_33.txt | AC | 24 ms | 804 KB |
test_34.txt | AC | 25 ms | 804 KB |
test_35.txt | AC | 25 ms | 796 KB |