Task: | Ruudukko |
Sender: | adex720 |
Submission time: | 2022-11-13 21:59:14 +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.01 s | 2, 3 | details |
#5 | ACCEPTED | 0.17 s | 2, 3 | details |
#6 | ACCEPTED | 0.29 s | 2, 3 | details |
#7 | ACCEPTED | 0.17 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>using namespace std;int main(){int MODULO = 1000000007;int n;std::cin >> n;int koko = n * n;int luvut[koko];long seuraavat[koko];for (int i = 0; i < koko; i++){std::cin >> luvut[i];}long yhteensa = 0;int nykyinen = 1;while (nykyinen <= koko){int seuraava = koko + 1;int index = -1;for (int y = 0; y < n; y++){for (int x = 0; x < n; x++){index++;if (luvut[index] > nykyinen){if (luvut[index] < seuraava)seuraava = luvut[index];continue;}if (luvut[index] < nykyinen){continue;}if (nykyinen == 1){seuraavat[index] = 1;yhteensa++;continue;}int seuraavia = 1; // 1 koska reitti voi loppua tähän ruutuunfor (int newY = 0; newY < n; newY++){if (newY != y && luvut[x + newY * n] < nykyinen){seuraavia += seuraavat[x + newY * n];if (seuraavia >= MODULO)seuraavia -= MODULO;}}int maali = (y + 1) * n;for (int newIndex = y * n; newIndex < maali; newIndex++){if (newIndex != index && luvut[newIndex] < nykyinen){seuraavia += seuraavat[newIndex];if (seuraavia >= MODULO)seuraavia -= MODULO;}}yhteensa += seuraavia;if (yhteensa >= MODULO)yhteensa -= MODULO;seuraavat[index] = seuraavia;}}nykyinen = seuraava;}std::cout << yhteensa;}
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) |