Task: | Ruudukko |
Sender: | jmarttinen |
Submission time: | 2022-11-01 23:21:55 +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.17 s | 2, 3 | details |
#5 | ACCEPTED | 0.35 s | 2, 3 | details |
#6 | ACCEPTED | 0.43 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <algorithm>#include <iostream>#include <map>#include <set>#include <vector>using namespace std;int n;vector<int> table;set<int> numbers;map<int, set<int>> numberLocations;map<int, long long> hashTable;bool areConnected(int a, int b) {return ((a - b) % n == 0) || (a/n == b/n);}set<int> allConnectedCells(int a) {set<int> connectedCells;for (int i=0; i<n; i++) {connectedCells.insert(n*i + (a % n));connectedCells.insert(a - (a % n) + i);}return connectedCells;}long long countPaths(int i) {long long total = 0;if (hashTable.count(i) != 0)total = hashTable[i];else {set<int> connectedCells = allConnectedCells(i);for (int cell: connectedCells) {if (table[cell] < table[i]) // connected per the ruletotal += (countPaths(cell) + 1) % 1000000007;}hashTable[i] = total;}return total;}int main() {int k;cin >> n;for (int i=0; i<n; i++) {for (int j=0; j<n; j++) {cin >> k;numbers.insert(k);table.push_back(k);if (numberLocations.count(k) == 0) {numberLocations[k] = set<int>();}numberLocations[k].insert(n*i+j);}}long long total = n*n;for (auto k: numbers) {for (auto i: numberLocations[k]) {total += countPaths(i);total = total % 1000000007;}}cout << total;}
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: 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) |