CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:vgtcross
Submission time:2022-11-09 00:07:11 +0200
Language:C++ (C++11)
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.01 s2, 3details
#7--3details
#8--3details
#9--3details

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 chains[1000][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";
for (i = 0; i < d * d; ++i) {
chainsFromThis = 1;
//p = orderTiles[i];
a = orderTiles[i].first;
b = orderTiles[i].second.first;
c = orderTiles[i].second.second;
for (j = 0; j < d; ++j) {
if (a > vals2[c][j]) chainsFromThis = (chainsFromThis + chains[j][c]) % M;
if (a > vals[b][j]) chainsFromThis = (chainsFromThis + chains[b][j]) % M;
}
chains[b][c] = chainsFromThis;
totalChains = (totalChains + chainsFromThis) % M;
}
/*for (int i = 0; i < d; ++i) {
cout << '\n';
for (int j = 0; j < d; ++j) {
cout << chains[i][j] << ' ';
}
}*/
cout << 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:

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)