Submission #7507382
Source Code Expand
// ---------------------------------------------------------- #include <stdio.h> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <list> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <cstdio> #include <vector> #include <string> #include <bitset> #include <cctype> #include <cstdlib> #include <cstring> #include <utility> #include <numeric> #include <complex> #include <sstream> #include <fstream> #include <iomanip> #include <cassert> #include <iostream> #include <iterator> #include <algorithm> #include <functional> using namespace std; typedef long long LL; typedef unsigned int UI; typedef long double LD; const LL MOD = (LL)1000000007; const LL LL_INF = (LL)1 << 62; const int INT_INF = (int)1 << 30; #define rSort(a) sort(a.rbegin(),a.rend()) #define Sort(a) sort(a.begin(),a.end()) #define Reverse(a) reverse(a.begin(),a.end()) #define Sum(a) accumulate(a.begin(), a.end(), 0) #define REP(i, n) for(UI i = 0;i < n;i++) #define REPR(i, n) for(UI i = n;i >= 0;i--) #define FOR(i, m, n) for(UI i = m;i < n;i++) #define pb(i) push_back(i) #define SWAP(x,y) ((x!=y)&&(x^=y,y^=x,x^=y)) int main(int argc, char* argv[]) { cin.tie(0); ios::sync_with_stdio(false); LD m; cin >> m; m /= 1000.0; if (m < 0.1) { cout << "00" << endl; } else if (0.1 <= m && m < 1) { cout << "0" << m * 10 << endl; } else if (1 <= m && m <= 5) { cout << m * 10 << endl; } else if (6 <= m && m <= 30) { cout << m + 50 << endl; } else if (35 <= m && m <= 70) { cout << (m - 30) / 5 + 80 << endl; } else if (70 < m) { cout << "89" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | soma62jp |
Language | C++ (Clang 3.8.0) |
Score | 0 |
Code Size | 1743 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 632 KB |
Judge Result
Set Name | all | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | 5 ms | 632 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | WA | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 1 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |