Task: | Ruudukko |
Sender: | tiitush |
Submission time: | 2022-11-10 00:08:44 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.08 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.09 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.10 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:6:51: warning: unused variable 'isoinNumero' [-Wunused-variable] 6 | int n, k = 0, l = 0, seula, rivi, sarake, isoinNumero = 0, reitit = 0, yksittaisreitit = 0; | ^~~~~~~~~~~
Code
#include <bits/stdc++.h>using namespace std;int main() {int n, k = 0, l = 0, seula, rivi, sarake, isoinNumero = 0, reitit = 0, yksittaisreitit = 0;cin>>n;int ruudukko[n][n];int ruudukko2[n][n];int ruudukko3[n][n];for (rivi = 0; rivi < n; rivi++) {for (sarake = 0; sarake < n; sarake++) {cin>>ruudukko[rivi][sarake];}}rivi=0;sarake=0;for (rivi = 0; rivi < n; rivi++) {for (sarake = 0; sarake < n; sarake++) {k = 0;l = 0;yksittaisreitit = 0;ruudukko2[rivi][sarake]=0;for (k = 0; k < n; k++) {if(ruudukko[rivi][sarake]>ruudukko[rivi][0+k] && ruudukko[rivi][0+k] != 0) {yksittaisreitit++;}}for (l = 0; l < n; l++) {if(ruudukko[rivi][sarake]>ruudukko[0+l][sarake] && ruudukko[0+l][sarake] != 0) {yksittaisreitit++;}}ruudukko2[rivi][sarake] += yksittaisreitit;}}seula = 0;for(seula = 1; seula < n*n+1; seula++) {for (rivi = 0; rivi < n; rivi++) {for (sarake = 0; sarake < n; sarake++) {if(ruudukko2[rivi][sarake]==seula && seula>1) {k = 0;l = 0;yksittaisreitit = 0;ruudukko3[rivi][sarake]=0;for (k = 0; k < n; k++) {if(ruudukko[rivi][sarake]>ruudukko[rivi][0+k] && ruudukko[rivi][0+k] != 0) {reitit++;if(ruudukko3[rivi][0+k]!=0) {ruudukko3[rivi][sarake] += ruudukko3[rivi][0+k];} else {ruudukko3[rivi][sarake] += ruudukko2[rivi][0+k];}}}for (l = 0; l < n; l++) {if(ruudukko[rivi][sarake]>ruudukko[0+l][sarake] && ruudukko[0+l][sarake] != 0) {reitit++;if(ruudukko3[0+l][sarake]!=0) {ruudukko3[rivi][sarake] += ruudukko3[0+l][sarake];} else {ruudukko3[rivi][sarake] += ruudukko2[0+l][sarake];}}}ruudukko3[rivi][sarake] += ruudukko2[rivi][sarake];}}}}reitit = 0;for (rivi=0; rivi<n; rivi++) {for (sarake = 0; sarake < n; sarake++) {reitit += ruudukko3[rivi][sarake];}//cout<<"\n";}reitit += n*n;//cout<<"\n";rivi=0;sarake=0;cout<<reitit;}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
120809 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
-1431052172 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
-1431194269 |
Test 4
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
10000 |
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
-1379075612 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
-2070247176 |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
(empty) |
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
229147081 |
user output |
---|
(empty) |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |