| Task: | Ruudukko |
| Sender: | jmarttinen |
| Submission time: | 2022-11-13 22:58:50 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 28 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 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.02 s | 2, 3 | details |
| #5 | ACCEPTED | 0.02 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.03 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int n;
set<pair<int,int>> allNumbers = set<pair<int,int>>();
map<int, ll> counts;
map<int, pair<int,ll>> rowSum;
map<int, ll> lastRowSum;
void countPaths(pair<int,int> x) {
auto r = rowSum[x.second / n + 1];
auto c = rowSum[-( x.second % n) - 1];
if (r.first < x.first) {
counts[x.second] += r.second % 1000000007;
if (!lastRowSum.count(x.second / n +1))
lastRowSum[x.second / n + 1] = 0;
else
lastRowSum[x.second / n + 1] = r.second + 1;
} else {
counts[x.second] += lastRowSum[x.second / n + 1];
rowSum[x.second / n + 1].second += lastRowSum[x.second / n +1];
}
if (c.first < x.first) {
counts[x.second] += c.second;
if (!lastRowSum.count(- (x.second % n) - 1))
lastRowSum[ - (x.second % n) - 1] = 0;
else
lastRowSum[- (x.second % n) - 1] = c.second + 1;
} else {
counts[x.second] += lastRowSum[-(x.second%n)-1];
rowSum[- (x.second%n) - 1].second += lastRowSum[-(x.second%n)-1];
}
rowSum[x.second / n + 1] = {x.first, counts[x.second] + r.second};
rowSum[-(x.second % n) - 1] = {x.first, counts[x.second] + c.second};
counts[x.second] %= 1000000007;
rowSum[x.second/n + 1].second %= 1000000007;
rowSum[-(x.second%n)-1].second %= 1000000007;
lastRowSum[x.second/n + 1] %= 1000000007;
lastRowSum[-(x.second%n)-1] %= 1000000007;
}
int main() {
cin >> n;
for (int i=1; i<n+1; i++) {
rowSum[i] = {0,0};
rowSum[-i] = {0,0};
}
int k;
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
cin >> k;
allNumbers.insert({k, n*i+j});
counts[n*i+j] = 1;
}
}
for (auto it = allNumbers.begin(); it != allNumbers.end(); it++) {
countPaths(*it);
}
ll total = 0;
for (auto x : counts) {
total += x.second;
total %= 1000000007;
}
cout << total;
}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: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 35891274 |
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) |
