結果
| 問題 | No.760 Where am I moved to? |
| ユーザー |
 ciel
|
| 提出日時 | 2018-11-25 22:04:29 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 8,407 bytes |
| コンパイル時間 | 1,841 ms |
| コンパイル使用メモリ | 181,872 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-06-26 23:00:25 |
| 合計ジャッジ時間 | 7,763 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,944 KB |
| testcase_03 | AC | 2 ms
6,944 KB |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | AC | 2 ms
6,944 KB |
| testcase_06 | AC | 2 ms
6,940 KB |
| testcase_07 | AC | 2 ms
6,940 KB |
| testcase_08 | AC | 2 ms
6,940 KB |
| testcase_09 | AC | 2 ms
6,940 KB |
| testcase_10 | AC | 2 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In function ‘void vizGraph(vvll&, int, std::string)’:
main.cpp:41:425: warning: ignoring return value of ‘int system(const char*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
41 | void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
| ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して！！
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
using vec = vector<double>;
using mat = vector<vec>;
mat mult(mat A, mat B) {
mat ret(3, vec(3));
rep(i, 3) {
rep(j, 3) {
rep(h, 3) {
ret[i][j] += A[i][h] * B[h][j];
}
}
}
return ret;
}
mat inv(mat a) {
mat ret(3, vec(3));
ret[0][0] = -(a[1][1]*a[2][2]-a[1][2]*a[2][1]);
ret[0][1] = +(a[0][1]*a[2][2]-a[0][2]*a[2][1]);
ret[0][2] = -(a[0][1]*a[1][2]-a[0][2]*a[1][1]);
ret[1][0] = +(a[1][0]*a[2][2]-a[1][2]*a[2][0]);
ret[1][1] = -(a[2][2]*a[0][0]-a[2][0]*a[0][2]);
ret[1][2] = +(a[0][0]*a[1][2]-a[0][2]*a[1][0]);
ret[2][0] = -(a[1][0]*a[2][1]-a[1][1]*a[2][0]);
ret[2][1] = +(a[0][0]*a[2][1]-a[0][1]*a[2][0]);
ret[2][2] = -(a[0][0]*a[1][1]-a[0][1]*a[1][0]);
double coeff = - 1. / (
+ a[0][0] * a[1][1] * a[2][2] + a[0][1] * a[1][2] * a[2][0] + a[0][2] * a[1][0] * a[2][1]
- a[0][2] * a[1][1] * a[2][0] - a[0][1] * a[1][0] * a[2][2] - a[0][0] * a[1][2] * a[2][1]
);
rep(i, 3) rep(j, 3) {
ret[i][j] *= coeff;
}
return ret;
}
void print(mat a) {
cout << "##########" << endl;
rep(i, 3) {
rep(j, 3) {
cout << a[i][j] << "\t\t";
}
cout << endl;
}
}
int main(void) {
double x, y, theta; cin >> x >> y >> theta; assert(0 <= theta && theta <= 360); theta *= M_PI / 180;
assert(-1e6 <= x && x <= 1e6);
assert(-1e6 <= y && y <= 1e6);
vector<double> p1_o(2, 1), p2_o(2, 1);
rep(i, 2) { cin >> p1_o[i]; assert(-1e6 <= p1_o[i] && p1_o[i] <= 1e6); }
rep(i, 2) { cin >> p2_o[i]; assert(-1e6 <= p2_o[i] && p2_o[i] <= 1e6); }
vec d_o = {p1_o[0] + p2_o[1] - p1_o[1], p1_o[1] + -(p2_o[0] - p1_o[0])};
// cout << p1_o << " " << p2_o << " " << d_o << endl;
vector<double> p1_x(2, 1), p2_x(2, 1);
rep(i, 2) { cin >> p1_x[i]; assert(-1e6 <= p1_x[i] && p1_x[i] <= 1e6); }
rep(i, 2) { cin >> p2_x[i]; assert(-1e6 <= p2_x[i] && p2_x[i] <= 1e6); }
vec d_x = {p1_x[0] + p2_x[1] - p1_x[1], p1_x[1] + -(p2_x[0] - p1_x[0])};
// cout << p1_x << " " << p2_x << " " << d_x << endl;
mat H_a(3, vec(3));
H_a[0][0] = cos(theta); H_a[0][1] = -sin(theta); H_a[0][2] = x;
H_a[1][0] = sin(theta); H_a[1][1] = +cos(theta); H_a[1][2] = y;
H_a[2][0] = 0; H_a[2][1] = 0; H_a[2][2] = 1;
// print(H_a);
mat P_o(3, vec(3, 1));
P_o[0][0] = p1_o[0];
P_o[1][0] = p1_o[1];
P_o[0][1] = p2_o[0];
P_o[1][1] = p2_o[1];
P_o[0][2] = d_o[0];
P_o[1][2] = d_o[1];
// print(P_o);
mat P_x(3, vec(3, 1));
P_x[0][0] = p1_x[0];
P_x[1][0] = p1_x[1];
P_x[0][1] = p2_x[0];
P_x[1][1] = p2_x[1];
P_x[0][2] = d_x[0];
P_x[1][2] = d_x[1];
// print(P_x);
// print(mult(inv(P_x) , P_x));
// print(inv(P_x));
mat H_b = mult(P_o, inv(P_x));
// print(H_b);
H_b = mult(H_b, H_a);
// print(H_b);
cout << ldout << H_b[0][2] << " " << H_b[1][2] << " " << atan2(H_b[1][0],H_b[0][0]) * 180.0 / M_PI << endl;
return 0;
}