Task: | Ruudukko |
Sender: | Finnduino |
Submission time: | 2022-11-09 23:53:34 +0200 |
Language: | C++ (C++17) |
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.01 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.02 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>#include <vector>#include <string>#include <algorithm>#include <variant>using namespace std;bool sortcol(const vector<int> &v1, const vector<int> &v2){return v1[1] < v2[1];}int main(){int GridSize;cin >> GridSize;int GridSizeSq = GridSize * GridSize;vector<vector<int>> Grid(GridSizeSq, vector<int>(2));vector<unsigned long long int> PathStorage(GridSizeSq, 1);unsigned long long int paths = 0;int Number;vector<int> oneRow(2);for (int i = 0; i < GridSizeSq; i++){cin >> Number;oneRow.at(0) = i;oneRow.at(1) = Number;Grid.at(i) = oneRow;}vector<vector<int>> SortedGrid(Grid);sort(SortedGrid.begin(), SortedGrid.end(), sortcol);int offset = 1;for (vector<int> member : SortedGrid){int position = member.at(0);int y = position / GridSize;int x = position - y * GridSize;unsigned long long int pathsInMe = PathStorage.at(position);// Check upfor (offset = 1; offset < y + 1; offset++){if (Grid[position - GridSize * offset][1] > Grid[position][1]){PathStorage.at(position - GridSize * offset) += pathsInMe;}}// Check downfor (offset = 1; offset < GridSize - y; offset++){if (Grid[position + GridSize * offset][1] > Grid[position][1]){PathStorage.at(position + GridSize * offset) += pathsInMe;}}// Check leftfor (offset = 1; offset < x + 1; offset++){if (Grid[position - offset][1] > Grid[position][1]){PathStorage.at(position - offset) += pathsInMe;}}// Check rightfor (offset = 1; offset < GridSize - x; offset++){if (Grid[position + offset][1] > Grid[position][1]){PathStorage.at(position + offset) += pathsInMe;}}paths += pathsInMe;}cout << paths;}
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 |
---|
15458403427179917387 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
14304827048592651429 |
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) |