CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:cppbetter
Submission time:2022-11-06 17:35:39 +0200
Language:C++ (C++17)
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED28
#2ACCEPTED33
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.01 s2, 3details
#5ACCEPTED0.01 s2, 3details
#6ACCEPTED0.02 s2, 3details
#7ACCEPTED0.21 s3details
#8--3details
#9--3details

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 recursion
inline 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 DOWN
for(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 UP
for(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 RIGHT
for(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 LEFT
for(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 case
sortedValueCords.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 values
uint64_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:

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)