Task: | Ruudukko |
Sender: | cppbetter |
Submission time: | 2022-11-06 17:35:39 +0200 |
Language: | C++ (C++17) |
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.21 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>#include <vector>// Array to map out how many routes go out of each value and the value itself// (paths from (mod 10^9 + 7, val)std::vector<std::pair<uint64_t, int>> g_Map;int g_LowestValue = 1000 * 1000 + 1;int n = 0;constexpr uint64_t c_ModVal = 1000000007;// Fixed recursioninline uint64_t GetRouteCount(int x, int y){auto& pair = g_Map[y * n + x];if(pair.first != 0)return pair.first;if(pair.second == g_LowestValue)return 0;// Check DOWNfor(int i = y + 1; i < n; i++)if(g_Map[i * n + x].second < pair.second)pair.first += g_Map[i * n + x].first + 1;// Check UPfor(int i = y - 1; i > -1; i--)if(g_Map[i * n + x].second < pair.second)pair.first += g_Map[i * n + x].first + 1;// Check RIGHTfor(int i = x + 1; i < n; i++)if(g_Map[y * n + i].second < pair.second)pair.first += g_Map[y * n + i].first + 1;// Check LEFTfor(int i = x - 1; i > -1; i--)if(g_Map[y * n + i].second < pair.second)pair.first += g_Map[y * n + i].first + 1;pair.first = pair.first % c_ModVal;return pair.first;}int main(){std::cin >> n;g_Map.resize(n * n);std::vector<std::vector<std::pair<int, int>>> sortedValueCords;// Worst casesortedValueCords.resize(n * n);for(int y = 0; y < n; y++){for(int x = 0; x < n; x++){int val = 0;std::cin >> val;if(val < g_LowestValue)g_LowestValue = val;g_Map[y * n + x] = {0, val};sortedValueCords[val - 1].emplace_back(x, y);}}// Get all route valuesuint64_t routeTotal = 0;for(auto& vec : sortedValueCords)for(auto& c : vec)routeTotal += GetRouteCount(c.first, c.second);std::cout << (routeTotal + n * n) % c_ModVal << "\n";}
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) |