Ruudukko

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++){
      |                    ~^~~~~~~~~~~~~~~~~~~

#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;
}

int main()
{
    int GridSize;
    cin >> GridSize;
    int GridSizeSq = GridSize * GridSize;
    vector<vector<int>> Grid(GridSizeSq, vector<int>(2));
    vector<string> PathStorage(GridSizeSq, "1");
    string 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;
        string pathsInMe = PathStorage.at(position);
        // Check up
        for (offset = 1; offset < y + 1; offset++)
        {
            if (Grid[position - GridSize * offset][1] > Grid[position][1])
            {
                PathStorage.at(position - GridSize * offset) = BigAddition(PathStorage.at(position - GridSize * offset),pathsInMe);
            }
        }
        // Check down
        for (offset = 1; offset < GridSize - y; offset++)
        {
            if (Grid[position + GridSize * offset][1] > Grid[position][1])
            {
                PathStorage.at(position + GridSize * offset) = BigAddition(PathStorage.at(position + GridSize * offset),pathsInMe);
            }
        }
        // Check left
        for (offset = 1; offset < x + 1; offset++)
        {
            if (Grid[position - offset][1] > Grid[position][1])
            {
                PathStorage.at(position - offset) = BigAddition(PathStorage.at(position - offset),pathsInMe);
            }
        }
        // Check right
        for (offset = 1; offset < GridSize - x; offset++)
        {
            if (Grid[position + offset][1] > Grid[position][1])
            {
                PathStorage.at(position + offset) = BigAddition(PathStorage.at(position + offset),pathsInMe);
            }
        }
        paths = BigAddition(paths, pathsInMe);
    }
    cout << mod(paths,1000000007);
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED