Submission #4180
Source Code Expand
#include <map> #include <set> #include <cmath> #include <stack> #include <queue> #include <string> #include <vector> #include <bitset> #include <fstream> #include <sstream> #include <stdio.h> #include <ctype.h> #include <string.h> #include <iostream> #include <algorithm> #include <sys/time.h> using namespace std; #define li int #define rep(i,to) for(li i=0;i<((li)(to));++i) #define pb push_back #define sz(v) ((li)(v).size()) #define bit(n) (1ll<<(li)(n)) #define all(vec) (vec).begin(),(vec).end() #define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++) #define MP make_pair #define F first #define S second int main(){ vector<int> vec; rep(i, 8) vec.pb(i); string mp[8]; rep(i, 8) cin>>mp[i]; bool ok = true; do{ ok = true; rep(i, 8)rep(j, i)if(abs(i - j) == abs(vec[i] - vec[j])) ok = false; if(!ok) continue; rep(i, 8)rep(j, 8)if(mp[i][j] =='Q' && vec[i] != j) ok = false; if(!ok) continue; rep(i, 8) mp[i][vec[i]] = 'Q'; rep(i, 8) cout<<mp[i]<<endl; break; }while(next_permutation(all(vec))); if(!ok) cout<<"No Answer"<<endl; } /* int main(){ double res = 0; li n; cin>>n; */
Submission Info
Submission Time | |
---|---|
Task | C - パズルのお手伝い |
User | Komaki |
Language | C++ (GCC 4.4.7) |
Score | 100 |
Code Size | 1235 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 692 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt, 01_rnd_30.txt, 01_rnd_31.txt, 01_rnd_32.txt, 01_rnd_33.txt, 01_rnd_34.txt, 01_rnd_35.txt, 01_rnd_36.txt, 01_rnd_37.txt, 01_rnd_38.txt, 01_rnd_39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1.txt | AC | 20 ms | 128 KB |
00_sample2.txt | AC | 26 ms | 128 KB |
01_rnd_00.txt | AC | 26 ms | 128 KB |
01_rnd_01.txt | AC | 20 ms | 128 KB |
01_rnd_02.txt | AC | 26 ms | 128 KB |
01_rnd_03.txt | AC | 25 ms | 128 KB |
01_rnd_04.txt | AC | 26 ms | 0 KB |
01_rnd_05.txt | AC | 26 ms | 0 KB |
01_rnd_06.txt | AC | 26 ms | 692 KB |
01_rnd_07.txt | AC | 26 ms | 0 KB |
01_rnd_08.txt | AC | 25 ms | 128 KB |
01_rnd_09.txt | AC | 25 ms | 128 KB |
01_rnd_10.txt | AC | 24 ms | 128 KB |
01_rnd_11.txt | AC | 25 ms | 128 KB |
01_rnd_12.txt | AC | 26 ms | 692 KB |
01_rnd_13.txt | AC | 21 ms | 128 KB |
01_rnd_14.txt | AC | 27 ms | 0 KB |
01_rnd_15.txt | AC | 24 ms | 128 KB |
01_rnd_16.txt | AC | 25 ms | 128 KB |
01_rnd_17.txt | AC | 26 ms | 688 KB |
01_rnd_18.txt | AC | 23 ms | 0 KB |
01_rnd_19.txt | AC | 21 ms | 0 KB |
01_rnd_20.txt | AC | 26 ms | 0 KB |
01_rnd_21.txt | AC | 25 ms | 692 KB |
01_rnd_22.txt | AC | 26 ms | 692 KB |
01_rnd_23.txt | AC | 25 ms | 688 KB |
01_rnd_24.txt | AC | 26 ms | 672 KB |
01_rnd_25.txt | AC | 23 ms | 128 KB |
01_rnd_26.txt | AC | 26 ms | 692 KB |
01_rnd_27.txt | AC | 21 ms | 672 KB |
01_rnd_28.txt | AC | 28 ms | 128 KB |
01_rnd_29.txt | AC | 26 ms | 128 KB |
01_rnd_30.txt | AC | 26 ms | 128 KB |
01_rnd_31.txt | AC | 26 ms | 128 KB |
01_rnd_32.txt | AC | 22 ms | 0 KB |
01_rnd_33.txt | AC | 27 ms | 692 KB |
01_rnd_34.txt | AC | 26 ms | 128 KB |
01_rnd_35.txt | AC | 26 ms | 128 KB |
01_rnd_36.txt | AC | 26 ms | 128 KB |
01_rnd_37.txt | AC | 26 ms | 128 KB |
01_rnd_38.txt | AC | 26 ms | 128 KB |
01_rnd_39.txt | AC | 26 ms | 128 KB |