Task: | Ruudukko |
Sender: | stpn129 |
Submission time: | 2022-11-13 19:01:44 +0200 |
Language: | C++ (C++11) |
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.23 s | 3 | details |
#8 | ACCEPTED | 0.66 s | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'void solve()': input/code.cpp:13:7: warning: unused variable 't0' [-Wunused-variable] 13 | int t0 = (int)time(NULL); | ^~
Code
#include "bits/stdc++.h"#define int long longusing namespace std;map<int, int> mp;const int mod = 1e9+ 7;void solve() {int n, i, j, m, val, x, res;int t0 = (int)time(NULL);cin >> n;unordered_map<int, int> isums;unordered_map<int, int> jsums;unordered_map<int, int> iadds;unordered_map<int, int> jadds;unordered_map<int, vector<int*>> cells;unordered_map<int, int>::iterator ii;vector<vector<int>> g(n, vector<int> (n));for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {cin >> x;int *ij = (int*)malloc(2 * sizeof(int));ij[0] = i;ij[1] = j;cells[x].push_back(ij);}}std::vector<int> keys;std::vector<int>::iterator ik;keys.reserve (cells.size());for (auto& it : cells) {keys.push_back(it.first);}std::sort (keys.begin(), keys.end());res = 0;for (int key : keys){iadds.clear();jadds.clear();for(int* pi : cells[key]){i = pi[0];j = pi[1];val = (1 + isums[i] + jsums[j]) % mod;res = (res + val) % mod;// cout << key << ":" << i << "/"<< j << "\n";iadds[i] = (iadds[i] + val) % mod;jadds[j] = (jadds[j] + val) % mod;}for (ii = iadds.begin(); ii != iadds.end(); ii++){m = ii->first;val = ii->second;isums[m] += val;isums[m] %= mod;}for (ii = jadds.begin(); ii != jadds.end(); ii++){m = ii->first;val = ii->second;jsums[m] += val;jsums[m] %= mod;}}cout << res << "\n";}signed main() {ios_base::sync_with_stdio(false);cin.tie(NULL);int t = 1;while (t--) {solve();}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: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |