Submission #535931
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> #include <cctype> #define mp make_pair #define pb push_back #define REP(i,a,n) for(int i = a;i < (n);i++) #define rep(i,n) for(int i = 0;i < (n);i++) #define all(s) s.begin(), s.end() #define rall(s) s.rbegin(), s.rend() #define range(x,min,max) ((min) <= (x) && (x) <= (max)) #define xyrange(x, minX, maxX, y, minY, maxY) (range(x, minX, maxX) && range(y, minY, maxY)) using namespace std; typedef long long LL; typedef vector<int> VI; typedef vector<vector<int> > VVI; typedef vector<string> VS; typedef vector<bool> VB; typedef pair<int,int> PII; const int DX[]={1,0,-1,0},DY[]={0,-1,0,1}; const int INF = INT_MAX / 2; int main(){ cin.tie(0); ios::sync_with_stdio(false); int n, m; cin >> n >> m; n %= 12; m %= 60; double m_angle = 6 * m; double n_angle = 30 * n + (m / 60.0 * 30); cout << abs(m_angle - n_angle) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 時計盤 |
User | tibimosu |
Language | C++11 (GCC 4.9.2) |
Score | 0 |
Code Size | 1231 Byte |
Status | WA |
Exec Time | 32 ms |
Memory | 932 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 | 28 ms | 924 KB |
1.txt | AC | 29 ms | 924 KB |
10.txt | AC | 28 ms | 800 KB |
11.txt | WA | 26 ms | 920 KB |
12.txt | WA | 28 ms | 912 KB |
13.txt | AC | 28 ms | 924 KB |
14.txt | AC | 30 ms | 932 KB |
15.txt | AC | 31 ms | 912 KB |
16.txt | AC | 28 ms | 920 KB |
17.txt | AC | 29 ms | 920 KB |
18.txt | AC | 29 ms | 920 KB |
19.txt | WA | 27 ms | 924 KB |
2.txt | AC | 28 ms | 924 KB |
20.txt | AC | 29 ms | 920 KB |
21.txt | AC | 29 ms | 868 KB |
22.txt | AC | 26 ms | 920 KB |
23.txt | AC | 28 ms | 872 KB |
24.txt | AC | 28 ms | 924 KB |
25.txt | AC | 30 ms | 860 KB |
26.txt | AC | 29 ms | 924 KB |
27.txt | AC | 28 ms | 872 KB |
28.txt | AC | 29 ms | 920 KB |
29.txt | AC | 29 ms | 924 KB |
3.txt | AC | 32 ms | 932 KB |
30.txt | WA | 28 ms | 872 KB |
4.txt | WA | 26 ms | 868 KB |
5.txt | AC | 27 ms | 792 KB |
6.txt | AC | 29 ms | 924 KB |
7.txt | AC | 28 ms | 804 KB |
8.txt | AC | 29 ms | 836 KB |
9.txt | AC | 27 ms | 868 KB |
subtask0_1.txt | AC | 31 ms | 912 KB |
subtask0_2.txt | AC | 28 ms | 872 KB |
subtask0_3.txt | AC | 28 ms | 868 KB |
subtask0_4.txt | AC | 27 ms | 920 KB |