zoj 3954 Seven-Segment Display 位运算
来源:互联网 发布:知柏地黄丸治耳鸣吗 编辑:程序博客网 时间:2024/06/14 09:02
https://vjudge.net/problem/ZOJ-3954
题目大意:如图所示。给你n串,问是否存在一个合理的a~g序列使得合法
做法:题目给出了刚开始的序列,我们先把这个存下来。然后对于每个例子
处理的时候采用二进制进行存储,因为如果使用了这一位的话,那么用二进
制存下来是肯定能存下的,只是可能顺序最后不同,那么我对这个顺序进行
排序,sort一遍,如果当前得到的序列和题目给出的序列一膜一样肯定就是
YES,否则出了偏差就是NO。
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-./// __.' ~. .~ `.__/// .'// \./ \\`./// .'// | \\`./// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`./// .'//.-" `-. | .-' "-.\\`./// .'//______.============-.. \ | / ..-============.______\\`./// .'______________________________\|/______________________________`.#pragma GCC optimize(2)#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=1e3+10;const int maxx=1e3+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;int s[12][8]={1,1,0,1,1,0,1,1,2,0,0,0,0,1,1,0,3,0,0,1,0,0,1,0,4,0,0,1,1,0,0,1,5,0,1,1,0,0,0,0,6,0,1,0,0,0,0,0,7,1,0,1,1,0,1,0,8,0,0,0,0,0,0,0,9,0,0,1,0,0,0,0};int hh[10];int ha[10];char op[10];void solve(){me(hh,0);me(ha,0);int x;s_1(x);FOR(1,x,i){int num;scanf("%d%s",&num,op+1);FOR(1,7,j){if(op[j]=='1')ha[j]|=(1<<(i-1));if(s[num-1][j]==1)hh[j]|=(1<<(i-1));}}sort(ha+1,ha+8);sort(hh+1,hh+8);int f=0;FOR(1,7,i) if(ha[i]!=hh[i]) f=1;if(f) puts("NO");else puts("YES");}void init(){FOR(0,8,i){FOR(0,7,j){cout<<s[i][j]<<" ";}cout<<endl;}}int main(){ // freopen( "in.txt" , "r" , stdin ); //freopen( "data.txt" , "w" , stdout ); int t=1; //init(); s_1(t); for(int cas=1;cas<=t;cas++) { //printf("Case #%d: ",cas); solve(); }}
阅读全文
0 0
- zoj 3954 Seven-Segment Display 位运算
- ZOJ 3954 Seven-Segment Display
- ZOJ 3954 Seven-Segment Display
- ZOJ 3954 Seven-Segment Display
- ZOJ Seven Segment Display
- ZOJ 3954 Seven-Segment Display(思维)
- ZOJ 3954 Seven-Segment Display (预处理)
- zoj 3954 Seven-Segment Display 思维
- zoj 3954 Seven-Segment Display(暴力枚举)
- ZOJ 3962 Seven Segment Display
- 【ZOJ 3962 Seven Segment Display】
- ZOJ-3954-Seven-Segment Display【17th浙大校赛】
- ZOJ 3954 Seven-Segment Display (预处理/状态压缩)
- ZOJ 3962Seven Segment Display (数位DP)
- zoj 3962 Seven Segment Display 数位dp
- zoj 3962 Seven Segment Display(数位dp)
- zoj 3962 Seven Segment Display 数位dp
- Seven-segment Display
- 并发队列ConcurrentLinkedQueue和阻塞队列LinkedBlockingQueue用法
- Linux select()详解
- 复制构造函数与普通构造函数的区别
- main函数的第三个参数envp
- iframe标签使用问题
- zoj 3954 Seven-Segment Display 位运算
- Android webview显示电脑版网页
- Java编译时出现编码GBK的不可映射字符错误
- 鸡兔同笼
- Android Room牛刀小试
- WebService 超简单入门教程(Java)
- java成员内部类
- 堆的创建
- Java Socket编程