結果

問題 No.471 直列回転機
ユーザー koyumeishikoyumeishi
提出日時 2016-12-07 18:28:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,056 bytes
コンパイル時間 1,556 ms
コンパイル使用メモリ 123,560 KB
実行使用メモリ 40,404 KB
最終ジャッジ日時 2024-07-16 11:26:54
合計ジャッジ時間 11,651 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample TLE * 1
other
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main(int, char**)':
main.cpp:57:13: warning: narrowing conversion of 'round(cos(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2)))' from 'double' to 'long long int' [-Wnarrowing]
   57 |       {round(cos(PI*r[i]/180.0)), round(-sin(PI*r[i]/180.0)), 0},
      |        ~~~~~^~~~~~~~~~~~~~~~~~~~
main.cpp:57:13: warning: narrowing conversion of 'round(cos(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2)))' from 'double' to 'long long int' [-Wnarrowing]
main.cpp:57:40: warning: narrowing conversion of 'round((- sin(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2))))' from 'double' to 'long long int' [-Wnarrowing]
   57 |       {round(cos(PI*r[i]/180.0)), round(-sin(PI*r[i]/180.0)), 0},
      |                                   ~~~~~^~~~~~~~~~~~~~~~~~~~~
main.cpp:57:40: warning: narrowing conversion of 'round((- sin(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2))))' from 'double' to 'long long int' [-Wnarrowing]
main.cpp:58:13: warning: narrowing conversion of 'round(sin(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2)))' from 'double' to 'long long int' [-Wnarrowing]
   58 |       {round(sin(PI*r[i]/180.0)), round( cos(PI*r[i]/180.0)), 0},
      |        ~~~~~^~~~~~~~~~~~~~~~~~~~
main.cpp:58:13: warning: narrowing conversion of 'round(sin(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_type)i)) / 1.8e+2)))' from 'double' to 'long long int' [-Wnarrowing]
main.cpp:58:40: warning: narrowing conversion of 'round(cos(((PI * (double)r.operator[](size_type)((std::vector<long long int, std::allocator<long long int> >::size_typ

ソースコード

diff #
プレゼンテーションモードにする

#include <complex>
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <functional>
#include <random>
#include <ctime>
#include "assert.h"
using namespace std;
//[n*p] * [p*m] => [n*m]
template<class T>
vector< vector<T> > multmat(const vector<vector<T> > &A, const vector<vector<T>> &B, int n, int p, int m){
vector<vector<T> > C(n, vector<T>(m,0));
for(int i=0; i<n; i++){
for(int k=0; k<p; k++){
for(int j=0; j<m; j++){
C[i][j] += A[i][k] * B[k][j];
//C[i][j] %= mod;
}
}
}
return C;
}
double PI = acos(-1.0);
int main(int argc, char* argv[]){
int n;
cin >> n;
vector<long long> ox(n), oy(n), r(n);
vector<vector<vector<long long>>> W(n);
for(int i=0; i<n; i++){
cin >> ox[i] >> oy[i] >> r[i];
vector<vector<long long>> shift0 = {
{1,0,-ox[i]},
{0,1,-oy[i]},
{0,0,1}
};
vector<vector<long long>> shift1 = {
{1,0,ox[i]},
{0,1,oy[i]},
{0,0,1}
};
vector<vector<long long>> rot = {
{round(cos(PI*r[i]/180.0)), round(-sin(PI*r[i]/180.0)), 0},
{round(sin(PI*r[i]/180.0)), round( cos(PI*r[i]/180.0)), 0},
{0,0, 1}
};
vector<vector<long long>> tmp = multmat(rot, shift0, 3,3,3);
W[i] = multmat(shift1, tmp, 3,3,3);
}
vector<vector<long long>> A = {
{1,0,0},
{0,1,0},
{0,0,1}
};
for(int i=0; i<n; i++){
vector<vector<long long>> tmp = multmat(W[i], A, 3,3,3);
A = tmp;
}
int m;
cin >> m;
vector<long long> px(m), py(m);
for(int i=0; i<m; i++){
cin >> px[i] >> py[i];
}
for(int i=0; i<m; i++){
vector<vector<long long>> ans = {
{px[i]},
{py[i]},
{1}
};
// for(int j=0; j<n; j++){
// vector<vector<long long>> tmp = multmat( W[j], ans, 3,3,1 );
// ans = tmp;
// }
auto res = multmat(A, ans, 3,3,1);
cout << res[0][0] << " " << res[1][0] << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0