| Task: | Ruudukko |
| Sender: | chaotic |
| Submission time: | 2022-11-01 19:47:44 +0200 |
| Language: | C++ (C++17) |
| 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.09 s | 2, 3 | details |
| #5 | WRONG ANSWER | 0.09 s | 2, 3 | details |
| #6 | WRONG ANSWER | 0.09 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using ll = long long;
class NxNArray {
public:
NxNArray(int n_): n(n_) { array.resize(n * n, 0); }
ll& operator()(int row, int col) { return array[row * n + col]; }
ll& operator[](int i) { return array[i]; }
int size() const { return n; }
ll sum_at(int row, int col) {
ll sum = 0;
for (int r = 0; r < n; ++r) { sum += (*this)(r, col); }
for (int c = 0; c < n; ++c) { sum += (*this)(row, c); }
// Älä laske itseään
sum -= 2 * (*this)(row, col);
// Reitti voi myös loppua tähän
sum += 1;
return sum;
}
ll sum_at(int i) { return sum_at(i / n, i % n); }
int n;
std::vector<ll> array;
};
NxNArray read_input() {
int n;
std::cin >> n;
NxNArray array{ n };
for (int i = 0; i < n * n; ++i) {
int v;
std::cin >> v;
array[i] = v;
}
return array;
}
ll mod = 10e9 + 7;
int main() {
std::cin.sync_with_stdio(false);
auto array = read_input();
// array.array = { 2, 1, 3, 1, 1, 1, 9, 2, 7 };
NxNArray sums(array.size());
const int n2 = array.size() * array.size();
for (int smallest = 0; smallest < n2; ++smallest) {
// Lasketaan summa kohdissa, joissa on pienin tähän laskematon luku
// Tehdään summien listasta kopio, jottei yhtä suuria lukuja lasketa mukaan
auto tmp_sums = sums;
for (int i = 0; i < n2; ++i) {
if (array[i] == smallest + 1) { tmp_sums[i] = sums.sum_at(i) % mod; }
}
sums = std::move(tmp_sums);
}
// Lopussa lasketaan kaikki yhteen
ll res = std::reduce(sums.array.begin(), sums.array.end());
std::cout << res % mod;
}
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: WRONG ANSWER
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| 6651279611 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 7574338870 |
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) |
