Ruudukko

#include <iostream>
#include <vector>
#include <algorithm>
//#include <chrono>
//#include <fstream>
//using namespace std::chrono;
using namespace std;

bool sortcol(const vector<int> &v1, const vector<int> &v2)
{
    return v1[1] < v2[1];
}

void addThenMod(unsigned int *one,unsigned int *two){
    *one = *one + *two;
    *one = *one%1000000007;
}

int main()
{
    
    //ifstream myFile ("GridResult.txt"); 
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int GridSize;
    cin >> GridSize;
    //myFile >> GridSize;
    //auto start = high_resolution_clock::now();
    int GridSizeSq = GridSize * GridSize;
    vector<vector<int>> Grid(GridSizeSq, vector<int>(2));
    vector<unsigned int> PathStorage(GridSizeSq, 1);
    unsigned int paths = 0;
    int Number;
    vector<int> oneRow(2);
    vector<vector<int>> SortedGrid(GridSizeSq, vector<int>(2));
    for (int i = 0; i < GridSizeSq; i++)
    {
        cin >> Number;
        //myFile >> Number;
        oneRow.at(0) = i;
        oneRow.at(1) = Number;
        Grid.at(i) = oneRow;
        SortedGrid.at(i) = oneRow;
    }
    //auto end = high_resolution_clock::now();
    //auto dur = duration_cast<milliseconds>(end-start);
    //cout << "Init Duration: " <<  dur.count() << endl;
    sort(SortedGrid.begin(), SortedGrid.end(), sortcol);
    //end = high_resolution_clock::now();
    //dur = duration_cast<milliseconds>(end-start);
    //cout << "Sort Duration: " <<dur.count() << endl;
    int offset = 1;
    int MaxAdditions = 0;
    int additions = 0;
    for (vector<int> member : SortedGrid)
    {

        int position = member.at(0);
        int y = position / GridSize;
        int x = position - y * GridSize;
        unsigned 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;
            }
        }
        if(additions > MaxAdditions)
            goto earlyEnd;
        // 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);
            }
        }
        if(additions > MaxAdditions)
            goto earlyEnd;
        // Check left
        for (offset = 1; offset < x + 1; offset++)
        {
            if (Grid[position - offset][1] > Grid[position][1])
            {
                addThenMod(&PathStorage.at(position - offset),&pathsInMe);
            }
        }
        if(additions > MaxAdditions)
            goto earlyEnd;
        // Check right
        for (offset = 1; offset < GridSize - x; offset++)
        {
            if (Grid[position + offset][1] > Grid[position][1])
            {
                addThenMod(&PathStorage.at(position + offset),&pathsInMe);
            }
        }
        earlyEnd:
        MaxAdditions ++;
        addThenMod(&paths, &pathsInMe);
        }
    //end = high_resolution_clock::now();
    //dur = duration_cast<milliseconds>(end-start);
    //cout << "Calulation Duraion: " << dur.count() << endl;
    cout << paths%1000000007 << endl;
}

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: ACCEPTED

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