Task: | Ruudukko |
Sender: | DualRed |
Submission time: | 2022-11-12 12:58:03 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | ACCEPTED | 39 |
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.01 s | 2, 3 | details |
#7 | ACCEPTED | 0.16 s | 3 | details |
#8 | ACCEPTED | 0.27 s | 3 | details |
#9 | ACCEPTED | 0.33 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:95:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<GridCell>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 95 | for(int k = 0; k < sameNumbers.size(); k++){ | ~~^~~~~~~~~~~~~~~~~~~~
Code
#include <bits/stdc++.h>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 isEqual(const GridCell &B){return this->value == B.value;}};bool compare(GridCell A, GridCell B){return A.value > B.value;}int TwoIntHash(int a, int b) {return a >= b ? a * a + a + b : a + b * b;}int main(){ios_base::sync_with_stdio(false);cin.tie(NULL);// INPUTint gridSize;cin >> gridSize;int* grid = new int[gridSize * gridSize];vector<GridCell> gridValues;int rowSums[gridSize];int colSums[gridSize];for (int y = 0; y < gridSize; y++){for (int x = 0; x < gridSize; x++){int val;cin >> val;grid[(y * gridSize) + x] = val;gridValues.push_back(GridCell(x, y, val));}rowSums[y] = 0;colSums[y] = 1;}sort(gridValues.begin(), gridValues.end(), compare);/*int gridSize = 1000;int* grid = new int[gridSize * gridSize];vector<GridCell> gridValues(gridSize * gridSize);int rowSums[gridSize];int colSums[gridSize];for (int y = 0; y < gridSize; y++){for (int x = 0; x < gridSize; x++){grid[(y * gridSize) + x] = (x+1) * (y+1);gridValues[(y * gridSize) + x] = GridCell(x, y, grid[(y * gridSize) + x]);}rowSums[y] = 0;colSums[y] = 1;}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++){vector<GridCell> sameNumbers;vector<int> sameCellValues;do{int n = (rowSums[gridValues[i].y] + colSums[gridValues[i].x]) % 1000000007;sameNumbers.push_back(gridValues[i]);sameCellValues.push_back(n);totalCount = (totalCount + n) % 1000000007;i++;} while (i < gridSize * gridSize && gridValues[i].isEqual(sameNumbers[0]));i--;for(int k = 0; k < sameNumbers.size(); k++){GridCell c = sameNumbers[k];int val = sameCellValues[k];rowSums[c.y] = (rowSums[c.y] + val) % 1000000007;colSums[c.x] = (colSums[c.x] + val) % 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;}
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: ACCEPTED
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
229147081 |
user output |
---|
229147081 |
Test 9
Group: 3
Verdict: ACCEPTED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
951147313 |