Task: | Ruudukko |
Sender: | Finnduino |
Submission time: | 2022-11-10 19:00:12 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.00 s | 1, 2, 3 | details |
#2 | RUNTIME ERROR | 0.00 s | 1, 2, 3 | details |
#3 | RUNTIME ERROR | 0.00 s | 1, 2, 3 | details |
#4 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#5 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#6 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.00 s | 3 | details |
#8 | RUNTIME ERROR | 0.00 s | 3 | details |
#9 | RUNTIME ERROR | 0.00 s | 3 | details |
Code
#include <iostream>#include <vector>#include <algorithm>#include <future>using namespace std;bool sortcol(const vector<int> &v1, const vector<int> &v2){return v1[1] < v2[1];}void addThenMod(unsigned long int *one,unsigned long int *two){*one = *one + *two;*one = *one%(unsigned long int)1000000007;}void UpComparison(vector<vector<int>> &Grid, int &offset, int &position, int &GridSize, unsigned long int &pathsInMe, vector<unsigned long int> &PathStorage){if(Grid[position - GridSize * offset][1] > Grid[position][1]){addThenMod(&PathStorage.at(position - GridSize * offset),&pathsInMe);}}void DownComparison(vector<vector<int>> &Grid, int &offset, int &position, int &GridSize, unsigned long int &pathsInMe, vector<unsigned long int> &PathStorage){if(Grid[position + GridSize * offset][1] > Grid[position][1]){addThenMod(&PathStorage.at(position + GridSize * offset),&pathsInMe);}}void LeftComparison(vector<vector<int>> &Grid, int &offset, int &position, int &GridSize, unsigned long int &pathsInMe, vector<unsigned long int> &PathStorage){if(Grid[position - offset][1] > Grid[position][1]){addThenMod(&PathStorage.at(position - offset),&pathsInMe);}}void RightComparison(vector<vector<int>> &Grid, int &offset, int &position, int &GridSize, unsigned long int &pathsInMe, vector<unsigned long int> &PathStorage){if(Grid[position + offset][1] > Grid[position][1]){addThenMod(&PathStorage.at(position + offset),&pathsInMe);}}int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);int GridSize;cin >> GridSize;int GridSizeSq = GridSize * GridSize;vector<future<void>> futures;futures.reserve(GridSizeSq*GridSize);vector<vector<int>> Grid(GridSizeSq, vector<int>(2));vector<vector<int>> SortedGrid(GridSize, vector<int>(2));vector<unsigned long int> PathStorage(GridSizeSq, 1);unsigned 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;SortedGrid.at(i) = oneRow;sort(SortedGrid.begin(), SortedGrid.end(), sortcol);}//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 int pathsInMe = PathStorage.at(position);// Check upfor (offset = 1; offset < y + 1; offset++){futures.push_back(async(launch::async,UpComparison,ref(Grid), ref(offset), ref(position), ref(GridSize), ref(pathsInMe), ref(PathStorage)));}// Check downfor (offset = 1; offset < GridSize - y; offset++){futures.push_back(async(launch::async,DownComparison,ref(Grid), ref(offset), ref(position), ref(GridSize), ref(pathsInMe), ref(PathStorage)));}// Check leftfor (offset = 1; offset < x + 1; offset++){futures.push_back(std::async(launch::async,LeftComparison,ref(Grid), ref(offset), ref(position), ref(GridSize), ref(pathsInMe), ref(PathStorage)));}// Check rightfor (offset = 1; offset < GridSize - x; offset++){futures.push_back(async(launch::async,RightComparison,ref(Grid), ref(offset), ref(position), ref(GridSize), ref(pathsInMe), ref(PathStorage)));}addThenMod(&paths, &pathsInMe);}cout << paths%1000000007;}
Test details
Test 1
Group: 1, 2, 3
Verdict: RUNTIME ERROR
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 2
Group: 1, 2, 3
Verdict: RUNTIME ERROR
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 3
Group: 1, 2, 3
Verdict: RUNTIME ERROR
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 4
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 5
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 6
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::out_of_range' what(): vector::_M_r...
Test 7
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 8
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
229147081 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 9
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc