Submission #1687889
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef vector<ll> Array; typedef vector<vector<ll>> DArray; #define fi first #define se second #define repl(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++) #define rep(i,n) repl(i,0,n-1) #define each(itr,v) for(auto itr:v) #define pb push_back #define all(x) (x).begin(),(x).end() #define dbg(x) cout<<#x"="<<x<<endl #define mmax(x,y) (x>y?x:y) #define mmin(x,y) (x<y?x:y) #define maxch(x,y) x=mmax(x,y) #define minch(x,y) x=mmin(x,y) #define uni(x) x.erase(unique(all(x)),x.end()) #define exist(x,y) (find(all(x),y)!=x.end()) #define bcnt __builtin_popcount #define ssort(x) sort(all(x)) #define mkpair(x,y) make_pair(x,y) #define INF INT_MAX/3 double short_arrow(double minute) { return 360.0 *(minute/60.0); } double long_arrow(double hour, int minute) { return 360 * (hour/12.0) + (360.0/12.0) * (minute/60.0); } int main(){ cin.sync_with_stdio(false); double hour,minute; cin >> hour >> minute; cout << abs(short_arrow(minute)-long_arrow(hour,minute)) << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 時計盤 |
User | hayabusa104 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1140 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 1 ms | 256 KB |
1.txt | WA | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | WA | 1 ms | 256 KB |
13.txt | WA | 1 ms | 256 KB |
14.txt | WA | 1 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | AC | 2 ms | 256 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | AC | 2 ms | 256 KB |
19.txt | WA | 2 ms | 256 KB |
2.txt | AC | 2 ms | 256 KB |
20.txt | WA | 2 ms | 256 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | WA | 2 ms | 256 KB |
3.txt | AC | 2 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |
4.txt | WA | 2 ms | 256 KB |
5.txt | WA | 2 ms | 256 KB |
6.txt | WA | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | WA | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |
subtask0_4.txt | AC | 1 ms | 256 KB |