Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- vector<string> names;
- vector<vector<string>> comp;
- int k,n;
- char go(int x, int y){
- for(int i=0;i<k;i++){
- int xi, yi;
- for(int j=0;j<n;j++){
- if(comp[i][j]==names[x])xi=j;
- if(comp[i][j]==names[y])yi=j;
- }
- bool isAlphabetic=true;
- for(int j=min(xi,yi)+1;j<=max(xi,yi);j++){
- if(comp[i][j]<comp[i][j-1]){
- isAlphabetic=false;
- }
- }
- if(!isAlphabetic){
- if(xi<yi)return '0';
- else return '1';
- }
- }
- return '?';
- }
- int main(){
- cin>>k>>n;
- for(int i=0;i<n;i++){
- string x;cin>>x;
- names.push_back(x);
- }
- for(int i=0;i<k;i++){
- vector<string> tmp;
- for(int j=0;j<n;j++){
- string x;cin>>x;
- tmp.push_back(x);
- }
- comp.push_back(tmp);
- }
- for(int i=0;i<n;i++){
- for(int j=0;j<n;j++){
- if(i==j){
- cout<<'B';
- } else {
- cout<<go(i,j);
- }
- }
- cout<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement