Task: | Ruudukko |
Sender: | vgtcross |
Submission time: | 2022-11-01 00:05:10 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 61 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.03 s | 2, 3 | details |
#5 | ACCEPTED | 0.06 s | 2, 3 | details |
#6 | ACCEPTED | 0.07 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int calculateChains(int, int)': input/code.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 19 | for (int k = 0; k < links[i][j].size(); k++) { | ~~^~~~~~~~~~~~~~~~~~~~
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; int calculateChains(int i, int j) { if (chains[i][j] != 0) return chains[i][j]; if (links[i][j].size() == 0) return chains[i][j] = 1; int chainsFromThis = 1; for (int k = 0; k < links[i][j].size(); k++) { chainsFromThis = (chainsFromThis + calculateChains(links[i][j][k].first, links[i][j][k].second)) % m; } return chains[i][j] = chainsFromThis; } 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; } } 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}); } } } for (int i = 0; i < d; i++) { for (int j = 0; j < d; j++) { totalChains = (totalChains + calculateChains(i, j)) % m; } } 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: 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) |