CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:vgtcross
Submission time:2022-11-22 00:56:51 +0200
Language:C++11
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED28
#2ACCEPTED33
#3ACCEPTED39
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.01 s2, 3details
#7ACCEPTED0.13 s3details
#8ACCEPTED0.33 s3details
#9ACCEPTED0.34 s3details

Code

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define M 1000000007;
using namespace std;

int d = 0;

int vals[1000][1000];
//int vals2[1000][1000];
int rowChains[1000];
int prevRowChains[1000];
int colChains[1000];
int prevColChains[1000];
int totalChains = 0;
vector<pair<int, pair<int, int>>> orderTiles;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //ifstream f("file.txt");
    
    cin >> d;
    //auto start = chrono::system_clock::now();
    
    int i, j;
    for (i = 0; i < d; ++i) {
        for (j = 0; j < d; ++j) {
            cin >> vals[i][j];
            orderTiles.push_back({/*vals2[j][i] = */vals[i][j], {i, j}});
        }
    }
    
    sort(orderTiles.begin(), orderTiles.end());
    //pair<int, pair<int, int>> p;
    int chainsFromThis, a, b, c;
    
    //auto stop1 = chrono::system_clock::now();
    //chrono::duration<double> time1 = stop1 - start;
    //cout << "\nmidtime: " << time1.count() << "\n";
    
    int prev = 0;
    for (i = 0; i < d * d; ++i) {
        //p = orderTiles[i];
        a = orderTiles[i].second.first;
        b = orderTiles[i].second.second;
        c = orderTiles[i].first;
        
        if (c > prev) {
            copy(rowChains, rowChains + 1000, prevRowChains);
            copy(colChains, colChains + 1000, prevColChains);
        }
        
        chainsFromThis = (1 + prevRowChains[a] + prevColChains[b]) % M;
        totalChains = (totalChains + chainsFromThis) % M;
        
        rowChains[a] = (rowChains[a] + chainsFromThis) % M;
        colChains[b] = (colChains[b] + chainsFromThis) % M;
        
        prev = c;
    }
    
    /*for (int i = 0; i < d; ++i) {
        cout << '\n';
        for (int j = 0; j < d; ++j) {
            cout << chains[i][j] << ' ';
        }
    }*/
    
    cout << "\n" << totalChains;
    //auto stop2 = chrono::system_clock::now();
    //chrono::duration<double> time2 = stop2 - start;
    //cout << "\ntime: " << time2.count();
}

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