Task: | Ruudukko |
Sender: | DualRed |
Submission time: | 2022-11-03 00:13:29 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 28 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 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.00 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.36 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.45 s | 2, 3 | details |
#7 | ACCEPTED | 0.07 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <chrono> #include <map> using namespace std; int RoutesFromPoint(int* grid[], int gridSize, int x, int y, map<string, int>& memo){ if(grid[x][y] == 1){ return 1; } string key = std::to_string(x) + "-" + "" + std::to_string(y); if (memo.count(key)){ return memo[key]; } int totalCount = 1; for (int x2 = 0; x2 < gridSize; x2++){ if (x2 != x && grid[x2][y] < grid[x][y]){ totalCount += RoutesFromPoint(grid, gridSize, x2, y, memo); } } for (int y2 = 0; y2 < gridSize; y2++){ if (y2 != y && grid[x][y2] < grid[x][y]){ totalCount += RoutesFromPoint(grid, gridSize, x, y2, memo); } } memo[key] = totalCount; return totalCount; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); // INPUT int gridSize; cin >> gridSize; int* grid[gridSize]; for (int i = 0; i < gridSize; i++){ grid[i] = new int[gridSize]; } for (int y = 0; y < gridSize; y++){ for (int x = 0; x < gridSize; x++){ cin >> grid[x][y]; } } //auto start = std::chrono::high_resolution_clock::now(); // ALG int totalCount = 0; map<string, int> memo = map<string, int>(); for (int y = 0; y < gridSize; y++){ for (int x = 0; x < gridSize; x++){ totalCount += RoutesFromPoint(grid, gridSize, x, y, memo); } } //auto end = std::chrono::high_resolution_clock::now(); //cout << "TIME: " << std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count() / 1000.0 << "\n"; cout << totalCount; }
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: WRONG ANSWER
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
-809668533 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
348370085 |
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) |