Task: | Ruudukko |
Sender: | Sup |
Submission time: | 2022-11-13 18:38:27 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 61 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 2, 3 | details |
#6 | ACCEPTED | 0.02 s | 2, 3 | details |
#7 | ACCEPTED | 0.18 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; #define MAX 1000 #define MODULO 1000000007 int input_array[MAX][MAX]; // this is the input array long result_array[MAX][MAX]; // this holds the final path counts in each cell bool compute_array[MAX][MAX]; // this tracks which cells were computed long pathCount; // Function that computes number of paths // starting from cell (x,y) long ComputeCellPaths(int n, int x, int y) { // checking if already calculated if (compute_array[x][y]) { return result_array[x][y]; } pathCount = result_array[x][y]; for (int i = 0; i < n; i++) { if (input_array[i][y] < input_array[x][y]) { pathCount = pathCount + 1 + ComputeCellPaths(n, i, y); } if (input_array[x][i] < input_array[x][y]) { pathCount = pathCount + 1 + ComputeCellPaths(n, x, i); } } result_array[x][y] = pathCount % MODULO; compute_array[x][y] = true; return pathCount; } // Main function int main() { //int i = 1; int number_of_rows; int input_row; // Input read cin >> number_of_rows; for (int i = 0; i < number_of_rows; i++) { for (int j = 0; j < number_of_rows; j++) { // int input_row; cin >> input_row; input_array[i][j] = input_row; result_array[i][j] = 0; if (input_row == 1) { compute_array[i][j] = true; } else { compute_array[i][j] = false; } } } // Calculating number of paths from each cell long numberOfPaths = number_of_rows * number_of_rows; // we count separately the "own" reference for (int i = 0; i < number_of_rows; i++){ for (int j = 0; j < number_of_rows; j++){ numberOfPaths = (numberOfPaths + ComputeCellPaths(number_of_rows, i, j)) % MODULO; } } cout << (numberOfPaths) << endl; // count of decreasing paths in a matrix return 0; }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
9 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
135 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
57 |
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: ACCEPTED
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
187458477 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
964692694 |
Test 7
Group: 3
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
1000000 |
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) |