| Task: | Ruudukko |
| Sender: | UpHereNorth |
| Submission time: | 2022-10-31 01:36:04 +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.01 s | 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 2, 3 | details |
| #7 | ACCEPTED | 0.87 s | 3 | details |
| #8 | ACCEPTED | 0.62 s | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N =1e5;
const int inf = 1e9;
const ll mod = 1e9 + 7;
map<int, vector<pair<int, int>>> m;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int> (n));
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
cin >> a[i][j];
m[a[i][j]].push_back({i, j});
}
}
vector<vector<ll>> ans(n, vector<ll> (n));
vector<ll> cols(n), rows(n);
ll sum = 0;
for(int i = 1; i <= n * n; ++i){
for(auto [y, x] : m[i]){
ans[y][x] = 1;
ans[y][x] += cols[x];
ans[y][x] %= mod;
ans[y][x] += rows[y];
ans[y][x] %= mod;
}
for(auto [y, x] : m[i]){
sum += ans[y][x];
sum%=mod;
cols[x]+=ans[y][x];
rows[y]+=ans[y][x];
}
}
cout << sum << "\n";
}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: ACCEPTED
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| 229147081 |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
