Submission #1868739

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
int judge(unordered_map<int, int> m) {
  FOR(i,1,9) {
    auto itr1=m.find(i);
    if (itr1==m.end()) continue;
    FOR(j,i+1,9) {
      auto itr2 = m.find(j);
      if (itr2==m.end()) continue;
//      printf("(%d, %d)-(%d, %d)\n",itr1->first, itr1->second, itr2->first, itr2->second);
      if (itr1->first == itr2->first || itr1->second == itr2->second
        || itr1->first+itr1->second == itr2->first+itr2->second
        || itr1->first-itr1->second == itr2->first-itr2->second) return 0;
    }
  }
  return 1;
}
int main(){
  char c[8][8];
  unordered_map<int, int> m;
  vector<int> v, l;
  int cnt=0;
  REP(i,8) {
    REP(j,8) {
      scanf(" %c", &c[i][j]);
      if (c[i][j] == 'Q') {
        auto itr=m.find(i+1);
        m[i+1] = j+1;
      }
    }
  }
  if (m.size()!=3 || judge(m)!=1) {
    printf("No Answer\n");
    return 0;
  }
  REP(i,8) {
    auto itr=m.find(i+1);
    if (itr==m.end()) v.push_back(i+1);
    int cnt=0;
    for (itr=m.begin(); itr!=m.end(); ++itr) {
      if (i+1 == itr->second) cnt=1;
    }
    if (cnt==0) l.push_back(i+1);
  }
  cerr << v.size() << endl;
  REP(i,l.size()) cerr << l[i];
  cerr << endl;
  do {
    unordered_map<int, int> mm = m;
    REP(i,v.size()) mm[v[i]]=l[i];    REP(i,v.size()) cerr << v[i];
    cerr << endl;
    if (judge(mm)==1) {
      char ans[8][8];
      REP(i,8) {
        REP(j,8) {
          if (mm[i+1]==j+1) printf("Q");
          else printf(".");
        }
        printf("\n");
      }
      return 0;
    }
  } while (next_permutation(v.begin(), v.end()));
//  for (auto itr=m.begin(); itr!=m.end(); ++itr) printf("%d-%d\n", itr->first, itr->second);

  printf("\n");
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
       scanf(" %c", &c[i][j]);
                             ^

Judge Result