Task: | Ruudukko |
Sender: | DualRed |
Submission time: | 2022-11-03 18:26:03 +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.01 s | 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 2, 3 | details |
#6 | ACCEPTED | 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 <chrono>#include <map>#include <vector>#include <algorithm>using namespace std;class GridCell{public:int x;int y;int value;GridCell(){this->x = -1;this->y = -1;this->value = -1;};GridCell(int x, int y, int value){this->x = x;this->y = y;this->value = value;}};bool compare(GridCell A, GridCell B){return A.value > B.value;}int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);// INPUTint gridSize;cin >> gridSize;int* grid[gridSize];int* gridCounter[gridSize];vector<GridCell> gridValues(gridSize * gridSize);for (int i = 0; i < gridSize; i++){grid[i] = new int[gridSize];gridCounter[i] = new int[gridSize];}for (int y = 0; y < gridSize; y++){for (int x = 0; x < gridSize; x++){cin >> grid[x][y];gridCounter[x][y] = 1;gridValues[(y * gridSize) + x] = GridCell(x, y, grid[x][y]);}}sort(gridValues.begin(), gridValues.end(), compare);/*int gridSize = 700;int* grid[gridSize];int* gridCounter[gridSize];vector<GridCell> gridValues(gridSize * gridSize);for (int i = 0; i < gridSize; i++){grid[i] = new int[gridSize];gridCounter[i] = new int[gridSize];}for (int y = 0; y < gridSize; y++){for (int x = 0; x < gridSize; x++){grid[x][y] = x*y;gridCounter[x][y] = 1;gridValues[(y * gridSize) + x] = GridCell(x, y, grid[x][y]);}}sort(gridValues.begin(), gridValues.end(), compare);*///auto start = std::chrono::high_resolution_clock::now();// ALGunsigned long long int totalCount = 0;for (int i = 0; i < gridSize * gridSize; i++){GridCell c = gridValues[i];int thisCellValue = grid[c.x][c.y];for (int y2 = 0; y2 < gridSize; y2++){if (grid[c.x][y2] < thisCellValue){gridCounter[c.x][y2] = (gridCounter[c.x][y2] + gridCounter[c.x][c.y]) % 1000000007;}}for (int x2 = 0; x2 < gridSize; x2++){if (grid[x2][c.y] < thisCellValue){gridCounter[x2][c.y] = (gridCounter[x2][c.y] + gridCounter[c.x][c.y]) % 1000000007;}}totalCount = (totalCount + gridCounter[c.x][c.y]) % 1000000007;}//auto end = std::chrono::high_resolution_clock::now();//cout << "TIME: " << std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count() / 1000.0 << "\n";cout << totalCount << "\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: 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) |