Task: | Ruudukko |
Sender: | stpn129 |
Submission time: | 2022-11-03 18:49:15 +0200 |
Language: | C++ (C++17) |
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.00 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.00 s | 2, 3 | details |
#5 | ACCEPTED | 0.25 s | 2, 3 | details |
#6 | ACCEPTED | 0.21 s | 2, 3 | details |
#7 | ACCEPTED | 0.07 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include "bits/stdc++.h"#define int long longusing namespace std;void init_code() {ios_base::sync_with_stdio(false);cin.tie(NULL);#ifndef ONLINE_JUDGEfreopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);#endif}const int mod = 1e9+ 7;map<int, int> mp;int f (int i, int j, int n, vector<vector<int>>& g) {int sum = 0;if (mp[i * n + j]) {return mp[i * n + j];}if (g[i][j] == 1) {return 1;}for (int t = 0; t < n; ++t) {if (g[i][j] > g[i][t]) {if (g[i][t] == 1) {sum++;} else {sum += (f(i, t, n, g) + 1) % mod;}}if (g[i][j] > g[t][j]) {if (g[t][j] == 1) {sum++;} else {sum += (f(t, j, n, g) + 1) % mod;}}}mp[i * n + j] += sum % mod;return sum % mod;}void solve() {int n;cin >> n;vector<vector<int>> g(n, vector<int> (n));for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {cin >> g[i][j];}}int res = 0;for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {if (g[i][j] == 1) {res++;continue;}res += (f(i, j, n, g) + 1) % mod;}}res %= mod;cout << res << ' ';}signed main() {init_code();int t = 1;//cin >> t;while (t--) {solve();}return 0;}
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: 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) |