| Task: | Ruudukko |
| Sender: | kasvoton |
| Submission time: | 2022-11-06 18:14:33 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 28 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #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.12 s | 2, 3 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #7 | RUNTIME ERROR | 0.53 s | 3 | details |
| #8 | RUNTIME ERROR | 0.69 s | 3 | details |
| #9 | RUNTIME ERROR | 0.70 s | 3 | details |
Code
#include <iostream>
using namespace std;
int main(void)
{
int n;
cin >> n;
int ruudukko[n][n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
cin >> ruudukko[i][j];
}
struct ruutu;
struct ruutu
{
int lkm;
struct ruutu *sr[2000];
};
struct ruutu ruudut[n][n];
long foo;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
foo = 0;
for (int k = 0; k < n; k++)
{
if (ruudukko[i][k] < ruudukko[i][j])
{
ruudut[i][j].sr[foo] = &ruudut[i][k];
foo++;
ruudut[i][j].lkm++;
}
if (ruudukko[k][j] < ruudukko[i][j])
{
ruudut[i][j].sr[foo] = &ruudut[k][j];
foo++;
ruudut[i][j].lkm++;
}
}
}
}
long summa[100] = {0};
summa[0] = n * n;
int a = 0;
struct ruutu *tama;
struct ruutu *e[n * n];
int seuraava[n * n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
tama = &ruudut[i][j];
foo = 0;
while (1)
{
if (tama -> lkm > 0)
{
for (int i = 0; i < 100; i++)
{
if (summa[i + 1] > 0)
continue;
summa[i] += tama -> lkm;
a = i;
if (summa[i] >= 1000000000)
{
summa[i + 1]++, a++;
summa[i] -= 1000000000;
}
break;
}
e[foo] = tama, seuraava[foo] = 0;
tama = tama -> sr[0];
foo++;
}
else
{
do
{
foo--;
if (foo < 0)
break;
seuraava[foo]++;
}
while (seuraava[foo] >= e[foo] -> lkm);
if (foo < 0)
break;
tama = e[foo] -> sr[seuraava[foo]];
foo++;
}
}
}
}
for (int i = 0; a > 0; i++)
{
summa[0] -= 1000000007;
for (int j = 0; j < a; j++)
{
if (summa[j] < 0)
{
summa[j] = 1000000000 + summa[j];
summa[j + 1]--;
}
if (summa[a] == 0)
a--;
}
}
cout << summa[0] << "\n";
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: TIME LIMIT EXCEEDED
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| (empty) |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| (empty) |
Test 7
Group: 3
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |