Submission #536660
Source Code Expand
#include<map> #include<set> #include<list> #include<cmath> #include<queue> #include<stack> #include<cstdio> #include<string> #include<vector> #include<complex> #include<cstdlib> #include<cstring> #include<climits> #include<numeric> #include<sstream> #include<iostream> #include<algorithm> #include<functional> #define MP make_pair #define PB push_back #define ALL(x) (x).begin(),(x).end() #define REP(i,n) for(int i=0;i<(n);i++) #define REP1(i,n) for(int i=1;i<(n);i++) #define REP2(i,d,n) for(int i=(d);i<(n);i++) #define RREP(i,n) for(int i=(n);i>=0;i--) #define CLR(a) memset((a),0,sizeof(a)) #define MCLR(a) memset((a),-1,sizeof(a)) #define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY)) using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef vector<int> VI; typedef vector<VI > VVI; typedef vector<string> VS; typedef vector<LL> VLL; typedef pair<int,int> PII; const int INF = 0x3f3f3f3f; const LL INFL = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-9; const int DX[]={1,0,-1,0},DY[]={0,-1,0,1}; int main(){ int n,m; double l,s,ans; cin >> n >> m; if(n >= 12){ n = n%12; } s=m*6; l=n*30+30*((double)m/60); if(s>l) ans=s-l; else ans=l-s; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 時計盤 |
User | litchi0503 |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 1327 Byte |
Status | WA |
Exec Time | 27 ms |
Memory | 928 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 | 26 ms | 800 KB |
1.txt | AC | 25 ms | 912 KB |
10.txt | AC | 26 ms | 800 KB |
11.txt | WA | 26 ms | 800 KB |
12.txt | WA | 25 ms | 928 KB |
13.txt | AC | 24 ms | 920 KB |
14.txt | AC | 24 ms | 672 KB |
15.txt | AC | 25 ms | 728 KB |
16.txt | AC | 27 ms | 792 KB |
17.txt | AC | 24 ms | 920 KB |
18.txt | AC | 25 ms | 796 KB |
19.txt | WA | 26 ms | 924 KB |
2.txt | AC | 26 ms | 924 KB |
20.txt | AC | 25 ms | 788 KB |
21.txt | AC | 25 ms | 804 KB |
22.txt | AC | 24 ms | 792 KB |
23.txt | AC | 23 ms | 928 KB |
24.txt | AC | 25 ms | 672 KB |
25.txt | AC | 25 ms | 796 KB |
26.txt | AC | 25 ms | 796 KB |
27.txt | AC | 25 ms | 800 KB |
28.txt | AC | 26 ms | 796 KB |
29.txt | AC | 25 ms | 800 KB |
3.txt | AC | 26 ms | 800 KB |
30.txt | WA | 25 ms | 928 KB |
4.txt | WA | 26 ms | 672 KB |
5.txt | AC | 26 ms | 796 KB |
6.txt | AC | 24 ms | 800 KB |
7.txt | AC | 25 ms | 928 KB |
8.txt | AC | 25 ms | 800 KB |
9.txt | AC | 24 ms | 672 KB |
subtask0_1.txt | AC | 25 ms | 672 KB |
subtask0_2.txt | AC | 24 ms | 920 KB |
subtask0_3.txt | AC | 25 ms | 672 KB |
subtask0_4.txt | AC | 25 ms | 800 KB |