Task: | Ruudukko |
Sender: | okkokko |
Submission time: | 2022-11-09 23:55:40 +0200 |
Language: | C++11 |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | ACCEPTED | 39 |
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.23 s | 3 | details |
#8 | ACCEPTED | 0.46 s | 3 | details |
#9 | ACCEPTED | 0.50 s | 3 | details |
Code
#include <iostream> #include <vector> #include <unordered_set> #include <set> #include <map> #include <utility> #include <bits/stdc++.h> using namespace std; const int DIVISOR = 1000000007; vector<int> line_row; vector<int> line_row_last; vector<int> line_col; vector<int> line_col_last; vector<int> line_row_added; vector<int> line_col_added; int total = 0; struct hashFunction { size_t operator()(const tuple<int, int, int> &x) const { return get<0>(x); } }; inline void calculate_routes(int number, int x, int y) { if (number != line_col_last[x]) { line_col_last[x] = number; line_col[x] = (line_col[x] + line_col_added[x]) % DIVISOR; line_col_added[x] = 0; } if (number != line_row_last[y]) { line_row_last[y] = number; line_row[y] = (line_row[y] + line_row_added[y]) % DIVISOR; line_row_added[y] = 0; } int value = (line_col[x] + line_row[y] + 1) % DIVISOR; total = (total + value) % DIVISOR; line_row_added[y] = (line_row_added[y] + value) % DIVISOR; line_col_added[x] = (line_col_added[x] + value) % DIVISOR; } bool cmp(const pair<int, pair<int, int>> &x, const pair<int, pair<int, int>> &y) { return x.first < y.first; } int main() { int n; cin >> n; // unordered_set<tuple<int, int, int>, hashFunction> values_coords; // values_coords.reserve(n * n); vector<pair<int, pair<int, int>>> values_coords_vec; values_coords_vec.reserve(n * n); int i, j, a; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { cin >> a; values_coords_vec.push_back(pair<int, pair<int, int>>(a, pair<int, int>(j, i))); } } // multimap<int, pair<int, int>> values_coords(values_coords_vec.begin(), values_coords_vec.end()); line_row = vector<int>(n, 0); line_row_last = vector<int>(n, 1); line_col = vector<int>(n, 0); line_col_last = vector<int>(n, 1); line_row_added = vector<int>(n, 0); line_col_added = vector<int>(n, 0); // vector<tuple<int, int, int>> v(values_coords.begin(), values_coords.end()); sort(values_coords_vec.begin(), values_coords_vec.end(), cmp); vector<pair<int, pair<int, int>>>::iterator itr; for (itr = values_coords_vec.begin(); itr != values_coords_vec.end(); itr++) { calculate_routes(itr->first, itr->second.first, itr->second.second); } cout << total << "\n"; return 0; }
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: ACCEPTED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
951147313 |