This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3HaBFkZ ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_3HaBFkZ;
int h,w;
cin>>h>>w;
vec(vi) a(h,vi(w));
rep(i,h){
rep(j,w){
char ch;
cin>>ch;
a[i][j]=(ch=='.');
}
}
set<vec(vi)> st;
vec(vi) _a=a;
for(int x=0;x<w;x++){
for(int y=0;y<h;y++){
vec(vi) nea=a;
a=_a;
crep(j,x,w){
rep(i,h){
nea[i][j-x]=a[i][j];
}
}
rep(j,x){
rep(i,h){
nea[i][w-x+j]=a[i][j];
}
}
swap(a,nea);
crep(i,y,h){
rep(j,w){
nea[i-y][j]=a[i][j];
}
}
rep(i,y){
rep(j,w){
nea[h-y+i][j]=a[i][j];
}
}
st.insert(nea);
}
}
auto vv=st.begin();
// for(auto vv : st){
for(auto v : *vv){
for(auto x : v) cout<<(x==0?"*":".");
cout<<"\n";
}
// }
//
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |