Submission #3925649
Source Code Expand
#include<cstdio> #include<cmath> #include<climits> #include<algorithm> #include<sstream> #include<iostream> #include<string> #include<queue> #include<stack> #include<set> #include<list> #include<map> #include<vector> using namespace std; #define rep(i,n) for(int i=0; i<n; i++) #define rept(i,a,b) for(int i=a; i<b; i++) #define ll long long #define IMIN INT_MIN; #define IMAX INT_MAX; int maxelem(vector<int> src) { int dst = IMIN; rep(i, src.size()) { dst = (dst > src[i]) ? dst : src[i]; } return dst; } int secondelem(vector<int> src) { int dst = IMIN; int dst2 = IMIN; rep(i, src.size()) { if (dst < src[i]) { dst2 = dst; dst = src[i]; } else if (dst2 < src[i]) { dst2 = src[i]; } } return dst2; } vector<int> count(vector<int> a) { int ma = maxelem(a); vector<int> count(ma+1, 0); rep(i, a.size()) { count[a[i]]++; } return count; } int find(vector<int> a, int b) { rep(i, a.size()) { if (a[i] == b) return i; } return -1; } double vv(double m) { double km = m / 1000; if (km < 0.1) return 0; else if (km <= 5) return km*10; else if (km <= 30) return km+50; else if (km <= 70) return (km-30)/5+80; else return 89; } int main(){ int m; cin >> m; string A; int ans = (int) vv(m); if (ans < 10) cout << 0 << ans << endl; else cout << to_string(ans) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | seito5296 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1423 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 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 | AC | 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 |