| Task: | Arpakuutiot |
| Sender: | Guuber |
| Submission time: | 2020-10-01 12:04:55 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 35 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 35 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2 | details |
| #3 | ACCEPTED | 0.01 s | 1, 2 | details |
| #4 | ACCEPTED | 0.01 s | 1, 2 | details |
| #5 | ACCEPTED | 0.01 s | 1, 2 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2 | details |
| #8 | ACCEPTED | 0.01 s | 1, 2 | details |
| #9 | ACCEPTED | 0.01 s | 1, 2 | details |
| #10 | ACCEPTED | 0.01 s | 1, 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #12 | ACCEPTED | 0.01 s | 2 | details |
| #13 | ACCEPTED | 0.01 s | 2 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #15 | ACCEPTED | 0.01 s | 2 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #18 | ACCEPTED | 0.01 s | 2 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #20 | ACCEPTED | 0.01 s | 2 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #23 | ACCEPTED | 0.01 s | 2 | details |
| #24 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #25 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #26 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #27 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #28 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #29 | RUNTIME ERROR | 0.01 s | 2 | details |
| #30 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #31 | ACCEPTED | 0.01 s | 1, 2 | details |
Compiler report
input/code.cpp: In function 'bool samat(std::vector<int>, std::vector<int>)':
input/code.cpp:27:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < a.size(); i++){
~~^~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:180:148: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if((s[y-2][x] != '.' && !z[y-2][x]) || (s[y-1][x-1] != '.'&& !z[y-1][x-1]) && (s[y-1][x+1] != '.'&& !z[y-1][x+1])){
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:146:45: warning: unused variable 'alkux' [-Wunused-variable]
int alkux = x;
^~~~~
input/code.cpp:147:45: w...Code
#include<bits/stdc++.h>
using namespace std;
char s[10][10];
/*
xxx...
.x....
.x....
......
......
*/
int z[10][10];
int loppu[10][10];
int paalla;
int edessa;
int vasemmalla;
int oikealla;
int takana;
int alhaalla;
int coo = 0;
vector<vector<int>> vastaukset = {};
bool samat(vector<int> a, vector<int> b){
for(int i = 0; i < a.size(); i++){
if(a[i] != b[i]) return false;
}
return true;
}
// int paalla = s[2][1]-'0';
// int edessa = s[1][1]-'0';
// int vasemmalla = s[0][0]-'0';
// int oikealla = s[0][2]-'0';
// int takana = s[3][1]-'0';
// int alhaalla = s[0][1]-'0';
vector<int> rotatex(vector<int> a1){
return {a1[0], a1[3], a1[1], a1[4], a1[2], a1[5]};
}
vector<int> rotatey(vector<int> a1){
return {a1[1], a1[5], a1[2], a1[3], a1[0], a1[4]};
}
bool tarkista(vector<int> a, vector<int> b){
// cout << "\n";
// for(auto u : b) cout << u << " ";
// cout << " SSS \n";
for(int k = 0; k < 4; k++){
for(int j = 0; j < 4; j++){
for(int i = 0; i < 4; i++){
// for(auto u : a) cout << u << " ";
// cout << "\n";
if(samat(a, b)) return 1;
a = rotatex(a);
}
a = rotatey(a);
}
a = rotatex(a);
}
// cout << "\n\n";
return 0;
}
int main(){
int n;
cin >> n;
for(int ss = 0; ss < n; ss++){
// cout << ss << " SSSS\n";
for(int i = 1; i < 6; i++){
for(int j = 1; j < 6; j++){
cin >> s[i][j];
}
}
for(int i = 0; i <= 6; i++){
s[0][i] = '.';
s[6][i] = '.';
s[i][0] = '.';
s[i][6] = '.';
}
for(int i = 0; i <= 7; i++){
for(int j = 0; j <= 7; j++){
//cout << s[i][j];
}
//cout << "\n";
}
int co = 0;
bool boss = 1;
vector<int> jarjestys = {1,2,3,4,5,6};
do{
bool bo = 0;
int x = 0;
co++;
int y = 0;
for(int i = 1; i < 6; i++){
if(bo) break;
for(int j = 1; j < 6; j++){
int e = 0;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
if(s[i-1][j] != '.'){
a = (s[i-1][j-1]!= '.') + (s[i-1][j+1] != '.') + (s[i-2][j] != '.');
}
if(s[i+1][j] != '.'){
b = (s[i+1][j-1] != '.') + (s[i+1][j-1] != '.') + (s[i+2][j]!= '.');
}
if(s[i][j-1]!= '.'){
c = (s[i][j-2]!= '.') + (s[i+1][j-1] != '.') + (s[i-1][j+1] != '.');
}
if(s[i][j+1] != '.'){
d = (s[i][j+2] != '.') + (s[i+1][j+1] != '.') + (s[i+1][j-1]!= '.');
}
if(s[i][j] != '.' ){
e = (s[i-1][j] != '.') + (s[i+1][j] != '.') + (s[i][j-1] != '.') + (s[i][j+1] != '.');
}
if(s[i][j]!= '.' && e == 1 && a < 2 && b < 2 && c < 2 && d < 2){
bo = true;
x = j;
y = i;
if(boss){
boss = 0;
//cout << y << " " << x << " y x\n";
}
break;
}
}
}
int alkux = x;
int alkuy = y;
paalla = jarjestys[0];
edessa = jarjestys[1];
vasemmalla = jarjestys[2];
oikealla = jarjestys[3];
takana = jarjestys[4];
alhaalla = jarjestys[5];
int paalla2;
int edessa2;
int vasemmalla2;
int oikealla2;
int takana2;
int alhaalla2;
for(int i = 0; i < 10; i++){
for(int j = 0; j < 10; j++){
z[i][j] = 0;
loppu[i][j] = 0;
}
}
bo = false;
int cs = 0;
int x2 = x;
int y2 = y;
z[y][x] = 1;
int co = 0;
while(cs < 5){
z[y][x] = 1;
loppu[y][x] = alhaalla;
if(s[y-1][x] != '.' && !z[y-1][x]){
if((s[y-2][x] != '.' && !z[y-2][x]) || (s[y-1][x-1] != '.'&& !z[y-1][x-1]) && (s[y-1][x+1] != '.'&& !z[y-1][x+1])){
bo = true;
x2 = x;
y2 = y-1;
paalla2 = edessa;
edessa2 = 0;
takana2 = paalla;
vasemmalla2 = vasemmalla;
oikealla2 = oikealla;
alhaalla2 = takana;
}else{
loppu[y-1][x] = takana;
takana2 = 0;
z[y-1][x] = 1;
}
cs++;
}
if(s[y+1][x] != '.' && !z[y+1][x]){
if((s[y+2][x]!= '.' && !z[y+2][x]) || (s[y+1][x+1] != '.'&& !z[y+1][x+1]) || (s[y+1][x-1] != '.'&& !z[y+1][x-1])){
x2 = x;
y2 = y+1;
paalla2 = takana;
edessa2 = paalla;
takana2 = 0;
vasemmalla2 = vasemmalla;
oikealla2 = oikealla;
alhaalla2 = edessa;
}else{
loppu[y+1][x] = edessa;
edessa2 = 0;
z[y+1][x] = 1;
}
cs++;
}
if(s[y][x+1] != '.' && !z[y][x+1]){
if( (s[y][x+2] != '.' && !z[y][x+2]) || (s[y-1][x+1] != '.'&& !z[y-1][x+1]) ||(s[y+1][x+1] != '.'&& !z[y+1][x+1]) ){
x2 = x+1;
y2 = y;
paalla2 = vasemmalla;
edessa2 = edessa;
takana2 = takana;
vasemmalla2 = 0;
oikealla2 = paalla;
alhaalla2 = oikealla;
}else{
loppu[y][x+1] = oikealla;
oikealla2 = 0;
z[y][x+1] = 1;
}
cs++;
}
if(s[y][x-1] != '.' && !z[y][x-1]){
if( (s[y][x-2] != '.' && !z[y][x-2]) || (s[y-1][x-1] != '.'&& !z[y-1][x-1]) || (s[y+1][x-1] != '.'&& !z[y+1][x-1]) ){
x2 = x-1;
y2 = y;
paalla2 = oikealla;
edessa2 = edessa;
takana2 = takana;
vasemmalla2 = paalla;
oikealla2 = 0;
alhaalla2 = vasemmalla;
}else{
loppu[y][x-1] = vasemmalla;
vasemmalla2 = 0;
z[y][x-1] = 1;
}
cs++;
}
x = x2;
y = y2;
alhaalla = alhaalla2;
oikealla = oikealla2;
paalla = paalla2;
takana = takana2;
edessa = edessa2;
vasemmalla = vasemmalla2;
takana = takana2;
}
bool bo2 = true;
for(int i = 1; i < 6; i++){
for(int j = 1; j < 6; j++){
if((int)(s[i][j]-'0') != loppu[i][j] && s[i][j] != '.'){
bo2 = false;
}
}
}
if(bo2) break;
}
while(next_permutation(jarjestys.begin(), jarjestys.end()));
//cout << co << " CO\n";
vastaukset.push_back(jarjestys);
//cout << "Paalla: " << jarjestys[0] << "\n";
//cout << "Edessa: " << jarjestys[1] << "\n";
//cout << "Vasemmalla: " << jarjestys[2] << "\n";
//cout << "Oikealla: " << jarjestys[3] << "\n";
//cout << "Takana: " << jarjestys[4] << "\n";
//cout << "Alhaalla: " << jarjestys[5] << "\n";
}
for(int i = 0; i < vastaukset.size(); i++){
bool sdf = false;
for(int j = 0; j < vastaukset.size(); j++){
if(tarkista(vastaukset[i], vastaukset[j]) && i != j){
sdf = true;
cout << j+1 << " ";
}
}
if(!sdf) cout << "-";
cout << "\n";
}
}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 3 165.. .4... .3... .2... ... |
| correct output |
|---|
| 3 - 1 |
| user output |
|---|
| 3 - 1 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 264.. .5... .3... .1... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 152.. .4... .3... .6... ... |
| correct output |
|---|
| 3 5 4 1 5 2 1 3 |
| user output |
|---|
| 3 5 4 1 5 2 1 3 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 142.. .6... .3... .5... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 123.. .4... .6... .5... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 213.. .6... .4... .5... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 314.. .5... .2... .6... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 163.. .2... .5... .4... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 9
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 264.. .1... .3... .5... ... |
| correct output |
|---|
| 2 3 1 3 1 2 5 4 |
| user output |
|---|
| 2 3 1 3 1 2 5 4 |
Test 10
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 214.. .3... .5... .6... ... |
| correct output |
|---|
| 5 3 4 2 4 2 3 1 |
| user output |
|---|
| 5 3 4 2 4 2 3 1 |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 .41.. .5... .2... 36... ... |
| correct output |
|---|
| 9 4 6 8 7 10 2 6 8 - ... |
| user output |
|---|
| (empty) |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 5.... 1436. .2... ..... ... |
| correct output |
|---|
| 5 8 6 10 4 7 9 3 7 9 1 8 ... |
| user output |
|---|
| 5 8 6 10 4 7 9 3 7 9 1 8 ... |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 2.... 41... .63.. .5... ... |
| correct output |
|---|
| 4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
| user output |
|---|
| 4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 1.... 634.. ..52. ..... ... |
| correct output |
|---|
| 2 3 4 5 6 9 10 1 3 4 5 6 9 10 1 2 4 5 6 9 10 1 2 3 5 6 9 10 1 2 3 4 6 9 10 ... |
| user output |
|---|
| (empty) |
Test 15
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .2... 4516. 3.... ..... ... |
| correct output |
|---|
| 5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
| user output |
|---|
| 5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
Test 16
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 .56.. .2... .4... 31... ... |
| correct output |
|---|
| 4 9 3 5 10 2 5 10 1 9 2 3 10 ... |
| user output |
|---|
| (empty) |
Test 17
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 ..62. .31.. 45... ..... ... |
| correct output |
|---|
| 2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ... |
| user output |
|---|
| (empty) |
Test 18
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 532.. .4... .1... .6... ... |
| correct output |
|---|
| 3 8 9 5 6 1 8 9 7 10 2 6 ... |
| user output |
|---|
| 3 8 9 5 6 1 8 9 7 10 2 6 ... |
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 .64.. .1... .3... 52... ... |
| correct output |
|---|
| 2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ... |
| user output |
|---|
| (empty) |
Test 20
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .4... 326.. .1... .5... ... |
| correct output |
|---|
| 4 7 8 6 9 10 5 1 7 8 3 ... |
| user output |
|---|
| 4 7 8 6 9 10 5 1 7 8 3 ... |
Test 21
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 .6... .4... 31... .25.. ... |
| correct output |
|---|
| 3 7 11 16 6 1 7 11 16 5 19 4 19 ... |
| user output |
|---|
| (empty) |
Test 22
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 3.... 5614. ..2.. ..... ... |
| correct output |
|---|
| 7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ... |
| user output |
|---|
| (empty) |
Test 23
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 42... .316. .5... ..... ... |
| correct output |
|---|
| 5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... |
| user output |
|---|
| 5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... Truncated |
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 ..5.. .623. 41... ..... ... |
| correct output |
|---|
| 2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ... |
| user output |
|---|
| (empty) |
Test 25
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 .46.. 53... .1... .2... ... |
| correct output |
|---|
| 2 3 5 7 15 17 19 1 3 5 7 15 17 19 1 2 5 7 15 17 19 8 10 11 14 1 2 3 7 15 17 19 ... |
| user output |
|---|
| (empty) |
Test 26
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 .61.. .4... 35... .2... ... |
| correct output |
|---|
| 8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ... |
| user output |
|---|
| (empty) |
Test 27
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 ..2.. 1463. .5... ..... ... |
| correct output |
|---|
| 2 3 5 6 9 20 1 3 5 6 9 20 1 2 5 6 9 20 11 19 1 2 3 6 9 20 ... |
| user output |
|---|
| (empty) |
Test 28
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 ...4. 5132. 6.... ..... ... |
| correct output |
|---|
| 2 8 10 12 13 19 1 8 10 12 13 19 4 5 15 16 17 3 5 15 16 17 3 4 15 16 17 ... |
| user output |
|---|
| (empty) |
Test 29
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 20 .2... .31.. 45... 6.... ... |
| correct output |
|---|
| 5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ... |
| user output |
|---|
| (empty) |
Error:
free(): invalid size
Test 30
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 20 3.... 452.. .1... .6... ... |
| correct output |
|---|
| 3 7 8 9 14 15 16 19 4 12 13 17 1 7 8 9 14 15 16 19 2 12 13 17 11 20 ... |
| user output |
|---|
| (empty) |
Test 31
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 2 546.. .3... .2... .1... ... |
| correct output |
|---|
| - - |
| user output |
|---|
| - - |