結果
| 問題 |
No.455 冬の大三角
|
| コンテスト | |
| ユーザー |
 shimomire
|
| 提出日時 | 2016-12-08 00:31:18 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 5,100 bytes |
| コンパイル時間 | 1,218 ms |
| コンパイル使用メモリ | 122,828 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-06-29 21:23:11 |
| 合計ジャッジ時間 | 3,035 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 54 |
コンパイルメッセージ
In member function 'void Main::run()',
inlined from 'int main()' at main.cpp:133:12:
main.cpp:119:58: warning: 'x2' may be used uninitialized [-Wmaybe-uninitialized]
119 | if((y2-y1)*(x3-x1) == (y3-y1)*(x2-x1)) continue;
| ~~~^~~~
main.cpp: In function 'int main()':
main.cpp:103:36: note: 'x2' was declared here
103 | int y1=-1,x1=-1,y2,x2;
| ^~
In member function 'void Main::run()',
inlined from 'int main()' at main.cpp:133:12:
main.cpp:119:31: warning: 'y2' may be used uninitialized [-Wmaybe-uninitialized]
119 | if((y2-y1)*(x3-x1) == (y3-y1)*(x2-x1)) continue;
| ~~~^~~~
main.cpp: In function 'int main()':
main.cpp:103:33: note: 'y2' was declared here
103 | int y1=-1,x1=-1,y2,x2;
| ^~
ソースコード
#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;
typedef long long ll;typedef unsigned long long ull;typedef long double ld;
#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"
struct range{
struct Iter{
int v,step;
Iter& operator++(){v+=step;return *this;}
bool operator!=(Iter& itr){return v<itr.v;}
int& operator*(){return v;}
};
Iter i, n;
range(int i, int n,int step):i({i,step}), n({n,step}){}
range(int i, int n):range(i,n,1){}
range(int n):range(0,n){}
Iter& begin(){return i;}
Iter& end(){return n;}
};
struct rrange{
struct Iter{
int v,step;
Iter& operator++(){v-=step;return *this;}
bool operator!=(Iter& itr){return v>itr.v;}
int& operator*(){return v;}
};
Iter i, n;
rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
rrange(int i, int n):rrange(i,n,1){}
rrange(int n) :rrange(0,n){}
Iter& begin(){return n;}
Iter& end(){return i;}
};
//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}
// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};
template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};
// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}
template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}
class Main{
public:
void run(){
int H,W;cin >> H >> W;
vector<string> board(H);cin >> board;
int y1=-1,x1=-1,y2,x2;
for(int y:range(H))for(int x:range(W)){
if(board[y][x]=='*'){
if(y1==-1) y1 = y,x1 = x;
else y2 = y, x2 = x;
}
}
// 適当に y1 の周りをまわって1直線上じゃなければ ok.
int dy[] = {0,1,1,1,0,-1,-1,-1};
int dx[] = {1,1,0,-1,-1,-1,0,1};
for(int d:range(8)){
int y3 = y1 + dy[d], x3 = x1 + dx[d];
if(!IN(0,y3,H) || !IN(0,x3,W)) continue;
if((y2-y1)*(x3-x1) == (y3-y1)*(x2-x1)) continue;
board[y3][x3] = '*';
break;
}
for(int y:range(H)){
cout << board[y] << endl;
}
}
};
int main(){
cout <<fixed<<setprecision(10);
cin.tie(0);
ios::sync_with_stdio(false);
Main().run();
return 0;
}