Task: | Ruudukko |
Sender: | vgtcross |
Submission time: | 2022-11-07 00:46:39 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#4 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.02 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.03 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>using namespace std;int d = 0;int m = 1000000007;int vals[1000][1000];bitset<2000> links[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();for (int i = 0; i < d; i++) {for (int j = 0; j < d; j++) {cin >> vals[i][j];orderTiles.push_back({vals[i][j], {i, j}});for (int i_2 = 0; i_2 < i; i_2++) {if (vals[i_2][j] < vals[i][j]) links[i][j][i_2] = 1;else if (vals[i_2][j] > vals[i][j]) links[i_2][j][i] = 1;}for (int j_2 = 0; j_2 < j; j_2++) {if (vals[i][j_2] < vals[i][j]) links[i][j][j_2 + d] = 1;else if (vals[i][j_2] > vals[i][j]) links[i][j_2][j + d] = 1;}}}sort(orderTiles.begin(), orderTiles.end());auto a = orderTiles.begin();pair<int, pair<int, int>> p;bitset<2000> b;int chainsFromThis;for (int i = 0; i < d * d; i++) {chainsFromThis = 1;p = *a;b = links[p.second.first][p.second.second];for (int j = 0; j < d; j++) {if (b[j]) chainsFromThis = (chainsFromThis + chains[j][p.second.second]) % m;}for (int j = 0; j < d; j++) {if (b[j + d]) chainsFromThis = (chainsFromThis + chains[p.second.first][j]) % m;}chains[p.second.first][p.second.second] = chainsFromThis % m;totalChains = (totalChains + chainsFromThis) % m;a++;}cout << totalChains;auto stop = chrono::system_clock::now();chrono::duration<double> time = stop - start;cout << "\ntime: " << time.count();}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
9 time: 3.2569e-05 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
135 time: 3.9376e-05 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
57 time: 3.8976e-05 |
Test 4
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
10000 time: 0.00664793 |
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
187458477 time: 0.0187755 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
964692694 time: 0.0240785 |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |