| Task: | Ruudukko |
| Sender: | Yamaxanadu |
| Submission time: | 2022-11-03 11:39:23 +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.30 s | 2, 3 | details |
| #5 | ACCEPTED | 0.26 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.38 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<long long,long long>> v;
map<long long,pair<long long,long long>> m;
long long n, a, c, j, ans;
j = 0;
ans = 0;
c = 0;
cin >> n;
for (long long i = 1; i <= n*n; i++) {
cin >> a;
v.push_back({a,i});
}
sort(v.begin(), v.end());
for (int i = 0; i < n*n; i++) {
c = 1;
for (long long x = 1; x <= n; x++) {
j = ((x-1)*n)+(v[i].second%n);
if (m.count(j) and v[i].first > m[j].second) {
c = c+m[j].first;
c = c%1000000007;
}
}
for (long long x = 1; x <= n; x++) {
if (v[i].second%n != 0) {
j = (v[i].second-(v[i].second%n))+x;
}
else {
j = (v[i].second-n)+x;
}
if (m.count(j) and v[i].first > m[j].second) {
c = c+m[j].first;
c = c%1000000007;
}
}
ans = ans + c;
ans = ans%1000000007;
m[v[i].second] = {c,v[i].first};
}
cout << ans;
}
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 |
|---|
| 997199838 |
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) |
