CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:Finnduino
Submission time:2022-11-10 01:20:58 +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
#7--3details
#8--3details
#9--3details

Compiler report

input/code.cpp: In function 'int mod(std::string, int)':
input/code.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i = 0; i<BigNumber.length(); i++){
      |                    ~^~~~~~~~~~~~~~~~~~~

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];
}
string BigAddition(string SumReceive, string toBeAdded){
string result = "";
if(SumReceive.length()>toBeAdded.length()){
swap(SumReceive, toBeAdded);
}
int len1 = SumReceive.length(), len2 = toBeAdded.length();
reverse(SumReceive.begin(), SumReceive.end());
reverse(toBeAdded.begin(), toBeAdded.end());
int offset = 0;
for(int i=0; i<len1; i++){
int sum = ((SumReceive[i]-'0')+(toBeAdded[i]-'0')+offset);
result.push_back(sum%10+'0');
offset = sum/10;
}
for(int i = len1; i < len2; i++)
{
int sum = ((toBeAdded[i]-'0')+offset);
result.push_back(sum%10+'0');
offset = sum/10;
}
if(offset){
result.push_back(offset+'0');
}
reverse(result.begin(), result.end());
return result;
}
int mod(string BigNumber, int SmallNumber){
unsigned long long int result = 0;
for(int i = 0; i<BigNumber.length(); i++){
result = (result * 10+(int)BigNumber[i]-'0')%SmallNumber;
}
return result;
}
void addThenMod(unsigned long int *one,unsigned long int *two){
*one = *one + *two;
*one = *one%1000000007;
}
int main()
{
int GridSize;
cin >> GridSize;
int GridSizeSq = GridSize * GridSize;
vector<vector<int>> Grid(GridSizeSq, 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;
}
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 int pathsInMe = PathStorage.at(position);
// Check up
for (offset = 1; offset < y + 1; offset++)
{
if (Grid[position - GridSize * offset][1] > Grid[position][1])
{
addThenMod(&PathStorage.at(position - GridSize * offset),&pathsInMe);
//PathStorage.at(position - GridSize * offset) += pathsInMe;
}
}
// Check down
for (offset = 1; offset < GridSize - y; offset++)
{
if (Grid[position + GridSize * offset][1] > Grid[position][1])
{
addThenMod(&PathStorage.at(position + GridSize * offset),&pathsInMe);
}
}
// Check left
for (offset = 1; offset < x + 1; offset++)
{
if (Grid[position - offset][1] > Grid[position][1])
{
addThenMod(&PathStorage.at(position - offset),&pathsInMe);
}
}
// Check right
for (offset = 1; offset < GridSize - x; offset++)
{
if (Grid[position + offset][1] > Grid[position][1])
{
addThenMod(&PathStorage.at(position + offset),&pathsInMe);
}
}
addThenMod(&paths, &pathsInMe);
}
cout << paths%1000000007;
}

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:

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:

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)