Submission #4013367
Source Code Expand
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
/*
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
*/
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
string s[14];
int dp[1<<14]={};
int dp2[1<<14]={};
int sumi[1<<14]={};
int dfs(int r){
if(sumi[r]) return dp2[r];
int ans=inf;
if(dp[r]==1){
dp2[r]=1;
sumi[r]=1;
return 1;
}
for(int i=r;i>0;i=((i-1)&r)){
if(i==r) continue;
ans=min(ans,dfs(i)+dfs(i^r));
}
sumi[r]=1;
dp2[r]=ans;
return ans;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++)for(int k=j+1;k<n;k++){
if(s[j][i]!='*' && s[k][i]!='*' && s[j][i]!=s[k][i]) dp[(1<<j)^(1<<k)]=1;
}
}
for(int i=0;i<(1<<n);i++)if(__builtin_popcount(i)>2){
for(int j=0;j<n;j++)if(i&(1<<j))for(int k=j+1;k<n;k++)if(i&(1<<k)){
if(dp[(1<<j)^(1<<k)])dp[i]=1;
}
}
for(int i=0;i<(1<<n);i++)dp[i]^=1;
cout<<dfs((1<<n)-1)<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 天下一文字列集合 |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
13207 Byte |
Status |
AC |
Exec Time |
94 ms |
Memory |
2384 KB |
Judge Result
Set Name |
small |
medium |
All |
Score / Max Score |
20 / 20 |
30 / 30 |
50 / 50 |
Status |
|
|
|
Set Name |
Test Cases |
small |
00_small100.txt, 00_small101.txt, 00_small102.txt, 00_small103.txt, 00_small104.txt, 00_small105.txt, 00_small106.txt, 00_small107.txt, 00_small108.txt, 00_small109.txt, 00_small110.txt, 00_small111.txt, 00_small112.txt, 00_small113.txt, 00_small114.txt, 00_small115.txt, 00_small116.txt, 00_small117.txt |
medium |
00_small100.txt, 00_small101.txt, 00_small102.txt, 00_small103.txt, 00_small104.txt, 00_small105.txt, 00_small106.txt, 00_small107.txt, 00_small108.txt, 00_small109.txt, 00_small110.txt, 00_small111.txt, 00_small112.txt, 00_small113.txt, 00_small114.txt, 00_small115.txt, 00_small116.txt, 00_small117.txt, 01_medium100.txt, 01_medium101.txt, 01_medium102.txt, 01_medium103.txt, 01_medium104.txt, 01_medium105.txt, 01_medium106.txt, 01_medium107.txt, 01_medium108.txt, 01_medium109.txt, 01_medium110.txt, 01_medium111.txt, 01_medium112.txt, 01_medium113.txt, 01_medium114.txt, 01_medium115.txt, 01_medium116.txt, 01_medium117.txt, 01_medium118.txt, 01_medium119.txt, 01_medium120.txt, 01_medium121.txt, 01_medium122.txt, 01_medium123.txt, 01_medium124.txt, 01_medium125.txt, 01_medium126.txt, 01_sample0.txt |
All |
00_small100.txt, 00_small101.txt, 00_small102.txt, 00_small103.txt, 00_small104.txt, 00_small105.txt, 00_small106.txt, 00_small107.txt, 00_small108.txt, 00_small109.txt, 00_small110.txt, 00_small111.txt, 00_small112.txt, 00_small113.txt, 00_small114.txt, 00_small115.txt, 00_small116.txt, 00_small117.txt, 01_medium100.txt, 01_medium101.txt, 01_medium102.txt, 01_medium103.txt, 01_medium104.txt, 01_medium105.txt, 01_medium106.txt, 01_medium107.txt, 01_medium108.txt, 01_medium109.txt, 01_medium110.txt, 01_medium111.txt, 01_medium112.txt, 01_medium113.txt, 01_medium114.txt, 01_medium115.txt, 01_medium116.txt, 01_medium117.txt, 01_medium118.txt, 01_medium119.txt, 01_medium120.txt, 01_medium121.txt, 01_medium122.txt, 01_medium123.txt, 01_medium124.txt, 01_medium125.txt, 01_medium126.txt, 01_sample0.txt, 02_large100.txt, 02_large101.txt, 02_large102.txt, 02_large103.txt, 02_large104.txt, 02_large105.txt, 02_large106.txt, 02_large107.txt, 02_large108.txt, 02_large109.txt, 02_large110.txt, 02_large111.txt, 02_large112.txt, 02_large113.txt, 02_large114.txt, 02_large115.txt, 02_large116.txt, 02_large117.txt, 02_large118.txt, 02_large119.txt, 02_large120.txt, 02_large121.txt, 02_large122.txt, 02_large123.txt, 02_large124.txt, 02_large125.txt, 02_large126.txt, 02_large127.txt, 02_large128.txt, 02_large129.txt, 02_large130.txt |
Case Name |
Status |
Exec Time |
Memory |
00_small100.txt |
AC |
1 ms |
256 KB |
00_small101.txt |
AC |
1 ms |
256 KB |
00_small102.txt |
AC |
1 ms |
256 KB |
00_small103.txt |
AC |
1 ms |
256 KB |
00_small104.txt |
AC |
1 ms |
256 KB |
00_small105.txt |
AC |
1 ms |
256 KB |
00_small106.txt |
AC |
1 ms |
256 KB |
00_small107.txt |
AC |
1 ms |
256 KB |
00_small108.txt |
AC |
1 ms |
256 KB |
00_small109.txt |
AC |
1 ms |
256 KB |
00_small110.txt |
AC |
1 ms |
256 KB |
00_small111.txt |
AC |
1 ms |
256 KB |
00_small112.txt |
AC |
1 ms |
256 KB |
00_small113.txt |
AC |
1 ms |
256 KB |
00_small114.txt |
AC |
1 ms |
256 KB |
00_small115.txt |
AC |
1 ms |
256 KB |
00_small116.txt |
AC |
1 ms |
256 KB |
00_small117.txt |
AC |
1 ms |
256 KB |
01_medium100.txt |
AC |
26 ms |
640 KB |
01_medium101.txt |
AC |
28 ms |
640 KB |
01_medium102.txt |
AC |
28 ms |
640 KB |
01_medium103.txt |
AC |
28 ms |
640 KB |
01_medium104.txt |
AC |
28 ms |
640 KB |
01_medium105.txt |
AC |
28 ms |
640 KB |
01_medium106.txt |
AC |
28 ms |
640 KB |
01_medium107.txt |
AC |
28 ms |
640 KB |
01_medium108.txt |
AC |
2 ms |
384 KB |
01_medium109.txt |
AC |
1 ms |
256 KB |
01_medium110.txt |
AC |
1 ms |
256 KB |
01_medium111.txt |
AC |
4 ms |
384 KB |
01_medium112.txt |
AC |
28 ms |
640 KB |
01_medium113.txt |
AC |
28 ms |
640 KB |
01_medium114.txt |
AC |
1 ms |
256 KB |
01_medium115.txt |
AC |
4 ms |
384 KB |
01_medium116.txt |
AC |
4 ms |
384 KB |
01_medium117.txt |
AC |
28 ms |
640 KB |
01_medium118.txt |
AC |
28 ms |
640 KB |
01_medium119.txt |
AC |
28 ms |
640 KB |
01_medium120.txt |
AC |
28 ms |
640 KB |
01_medium121.txt |
AC |
28 ms |
640 KB |
01_medium122.txt |
AC |
28 ms |
640 KB |
01_medium123.txt |
AC |
28 ms |
640 KB |
01_medium124.txt |
AC |
28 ms |
768 KB |
01_medium125.txt |
AC |
29 ms |
640 KB |
01_medium126.txt |
AC |
28 ms |
640 KB |
01_sample0.txt |
AC |
1 ms |
256 KB |
02_large100.txt |
AC |
48 ms |
2256 KB |
02_large101.txt |
AC |
50 ms |
2256 KB |
02_large102.txt |
AC |
49 ms |
2256 KB |
02_large103.txt |
AC |
49 ms |
2256 KB |
02_large104.txt |
AC |
49 ms |
2256 KB |
02_large105.txt |
AC |
49 ms |
2256 KB |
02_large106.txt |
AC |
33 ms |
1024 KB |
02_large107.txt |
AC |
28 ms |
768 KB |
02_large108.txt |
AC |
11 ms |
512 KB |
02_large109.txt |
AC |
1 ms |
256 KB |
02_large110.txt |
AC |
1 ms |
256 KB |
02_large111.txt |
AC |
51 ms |
2000 KB |
02_large112.txt |
AC |
63 ms |
2256 KB |
02_large113.txt |
AC |
30 ms |
896 KB |
02_large114.txt |
AC |
53 ms |
2000 KB |
02_large115.txt |
AC |
26 ms |
2000 KB |
02_large116.txt |
AC |
83 ms |
2256 KB |
02_large117.txt |
AC |
3 ms |
512 KB |
02_large118.txt |
AC |
86 ms |
2256 KB |
02_large119.txt |
AC |
90 ms |
2256 KB |
02_large120.txt |
AC |
93 ms |
2256 KB |
02_large121.txt |
AC |
94 ms |
2256 KB |
02_large122.txt |
AC |
91 ms |
2256 KB |
02_large123.txt |
AC |
83 ms |
2256 KB |
02_large124.txt |
AC |
75 ms |
2384 KB |
02_large125.txt |
AC |
66 ms |
2256 KB |
02_large126.txt |
AC |
60 ms |
2256 KB |
02_large127.txt |
AC |
83 ms |
2256 KB |
02_large128.txt |
AC |
55 ms |
2256 KB |
02_large129.txt |
AC |
87 ms |
2256 KB |
02_large130.txt |
AC |
54 ms |
2256 KB |