| Task: | Ruudukko |
| Sender: | EeliH |
| Submission time: | 2022-11-02 11:19:53 +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.01 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.01 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #7 | WRONG ANSWER | 0.26 s | 3 | details |
| #8 | WRONG ANSWER | 0.45 s | 3 | details |
| #9 | WRONG ANSWER | 0.57 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
const uint64_t AAAA = 1000000007;
int n;
uint64_t reitit[1000][1000];
uint64_t ruudukko[1000][1000];
pair<int, pair<int, int>> rows[1000][1000];
pair<int, pair<int, int>> cols[1000][1000];
uint64_t reititcols[1000][1000];
uint64_t reititrows[1000][1000];
uint64_t maaralaske_reitit = 0;
uint64_t maaralaske_reitit_nopea = 0;
bool rowcolcmp(pair<int, pair<int, int>> i, pair<int, pair<int, int>> j)
{
return i.first < j.first;
}
uint64_t laske_reitit(int i, int j, int coli, int rowi)
{
//cout << "laske_reitit " << i << " " << j << endl;
int re = reitit[i][j];
if (re != -1) {
maaralaske_reitit_nopea++;
return re;
}
int r = ruudukko[i][j];
if (r == 1) {
reitit[i][j] = 0;
return 0;
}
uint64_t nreitit = 0;
/*for (int k = 0; k < n; k++) {
maaralaske_reitit++;
pair<int, pair<int, int>> col = cols[i][k];
//cout << "col " << cols[i][k].first << ": " << cols[i][k].second.first << ", " << cols[i][k].second.second << endl;
//cout << "comp " << ruudukko[i][j] << endl;
if (col.first >= r) {
break;
}
nreitit += 1 + laske_reitit(i, col.second.second);
}
for (int k = 0; k < n; k++) {
maaralaske_reitit++;
//cout << "row " << rows[j][k].first << ": " << rows[j][k].second.first << ", " << rows[j][k].second.second << endl;
//cout << "comp " << ruudukko[i][j] << endl;
pair<int, pair<int, int>> row = rows[j][k];
if (row.first >= r) {
break;
}
nreitit += 1 + laske_reitit(row.second.first, j);
}*/
/*for (int k = 0; k < n; k++) {
maaralaske_reitit++;
if (ruudukko[i][k] < r) {
nreitit += 1 + laske_reitit(i, k);
}
if (ruudukko[k][j] < r) {
nreitit += 1 + laske_reitit(k, j);
}
}*/
nreitit %= AAAA;
reitit[i][j] = nreitit;
return nreitit;
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int arvo;
//cin >> ruudukko[i][j];
cin >> arvo;
ruudukko[i][j] = arvo;
rows[j][i] = make_pair(arvo, make_pair(i, j));
cols[i][j] = make_pair(arvo, make_pair(i, j));
if (arvo == 1) {
reitit[i][j] = 0;
} else {
reitit[i][j] = -1;
}
}
}
for (int i = 0; i < n; i++) {
sort(rows[i], rows[i]+n, rowcolcmp);
sort(cols[i], cols[i]+n, rowcolcmp);
}
uint64_t nreitit = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
//nreitit += 1 + laske_reitit(i, j);
}
}
cout << nreitit % 1000000007 << endl;
cout << "Määrä laske_reitit: " << maaralaske_reitit << endl;
cout << "Määrä laske_reitit nopea: " << maaralaske_reitit_nopea << endl;
}
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 |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
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 |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
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 |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
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 |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
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 |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
Test 7
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
Test 8
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
Test 9
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| 0 Määrä laske_reitit: 0 Määrä laske_reitit nopea: 0 |
