| Task: | Ruudukko |
| Sender: | stpn129 |
| Submission time: | 2022-11-02 14:22:54 +0200 |
| Language: | C++ (C++17) |
| 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.03 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.04 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 dfs(int, int, std::vector<int>&, std::vector<int>&, std::vector<int>*, std::vector<int>&)':
input/code.cpp:22:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | for (int i = 0; i < g[v].size(); ++i) {
| ~~^~~~~~~~~~~~~
input/code.cpp:17:7: warning: unused variable 'res' [-Wunused-variable]
17 | int res = 0;
| ^~~Code
#include "bits/stdc++.h"
using namespace std;
void init_code() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int mod = 1e9 + 7;
int dfs (int v, int n, vector<int>& used, vector<int>& p, vector<int> g[], vector<int>& f) {
int res = 0;
if (used[v]) {
return p[v] % mod;
}
used[v] = 1;
for (int i = 0; i < g[v].size(); ++i) {
p[g[v][i]] = f[g[v][i]] + dfs(g[v][i], n, used, p, g, f);
}
return p[v] % mod;
}
void solve() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int> (n));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
vector<int> g[n * n];
vector<int> f(n * n), p(n * n), used(n * n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
for (int x = 0; x < n; ++x) {
if (a[x][j] < a[i][j]) {
//g[i * n + j].push_back(x * n + j);
f[x * n + j]++;
g[x * n + j].push_back(i * n + j);
}
}
for (int y = 0; y < n; ++y) {
if (a[i][y] < a[i][j]) {
//g[i * n + j].push_back(i * n + y);
f[i * n + y]++;
g[i * n + y].push_back(i * n + j);
}
}
}
}
int res = 0;
for (int i = 0; i < n * n; ++i) {
if (!used[i]) {
dfs(i, n, used, p, g, f);
}
}
for (int i = 0; i < n * n; ++i) {
res += p[i] % mod;
}
res += n * n;
res *= 2;
res %= mod;
cout << res << '\n';
}
signed main() {
init_code();
int t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}
/*
*/
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 |
|---|
| 18 |
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 |
|---|
| 66 |
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 |
|---|
| 52 |
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 |
|---|
| 20000 |
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 |
|---|
| 162710000 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 130007288 |
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) |
