CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:vgtcross
Submission time:2022-11-04 16:06:46 +0200
Language:C++11
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED28
#2ACCEPTED33
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.03 s2, 3details
#5ACCEPTED0.07 s2, 3details
#6ACCEPTED0.07 s2, 3details
#7--3details
#8--3details
#9--3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:51:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for (int j = 0; j < v.size(); j++) {
      |                         ~~^~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

int d = 0;
int m = 1000000007;

int vals[1000][1000];
vector<pair<int, int>> links[1000][1000];
int chains[1000][1000];
int totalChains = 0;
set<pair<int, pair<int, int>>> orderTiles;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> d;
    
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < d; j++) {
            cin >> vals[i][j];
            chains[i][j] = 0;
            orderTiles.insert({vals[i][j], {i, j}});
        }
    }
    
    for (int i = 0; i < d; i++) {
        for (int j = 0; j < d; j++) {
            for (int i_2 = i + 1; i_2 < d; i_2++) {
                if (vals[i_2][j] < vals[i][j]) links[i][j].push_back({i_2, j});
                else if (vals[i_2][j] > vals[i][j]) links[i_2][j].push_back({i, j});
            }
            for (int j_2 = j + 1; j_2 < d; j_2++) {
                if (vals[i][j_2] < vals[i][j]) links[i][j].push_back({i, j_2});
                else if (vals[i][j_2] > vals[i][j]) links[i][j_2].push_back({i, j});
            }
        }
    }
    
    auto a = orderTiles.begin();
    pair<int, pair<int, int>> p;
    vector<pair<int, int>> v;
    int chainsFromThis;
    
    for (int i = 0; i < d * d; i++) {
        chainsFromThis = 1;
        p = *a;
        v = links[p.second.first][p.second.second];
        
        for (int j = 0; j < v.size(); j++) {
            chainsFromThis = (chainsFromThis + chains[v[j].first][v[j].second]) % m;
        }
        
        chains[p.second.first][p.second.second] = chainsFromThis;
        totalChains = (totalChains + chainsFromThis) % m;
        a++;
    }
    
    cout << totalChains;
}

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)