Task: | Ruudukko |
Sender: | smalyarovsky |
Submission time: | 2022-11-13 21:30:36 +0200 |
Language: | C++ (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.22 s | 3 | details |
#8 | ACCEPTED | 0.22 s | 3 | details |
#9 | ACCEPTED | 0.30 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:38:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 38 | for (auto [val, i, j] : p) { | ^ input/code.cpp:43:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 43 | for (auto [I, J, add] : curs) { | ^ input/code.cpp:54:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' 54 | for (auto [I, J, add] : curs) { | ^
Code
#include <iostream>#include <vector>#include <algorithm>#include <map>#include <set>#include <cmath>#include <numeric>#include <random>#include <chrono>#include <ctime>#define int long long#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using namespace std;const int INF = 1e18, MOD = 1e9 + 7;signed main() {//freopen("file.in", "r", stdin);//freopen("file.out", "w", stdout);ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.precision(20);cout.setf(ios::fixed);int n; cin >> n;vector<vector<int>> a(n, vector<int> (n)), dp(n,vector<int> (n, 0));vector<tuple<int, int, int>> p;for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {cin >> a[i][j];p.emplace_back(a[i][j], i, j);}}sort(all(p));vector<int> x(n, 0), y(n, 0);int cur = -1;vector<tuple<int, int, int>> curs;for (auto [val, i, j] : p) {if (val == cur) {curs.emplace_back(i, j, (1 + x[i] + y[j]) % MOD);continue;}for (auto [I, J, add] : curs) {dp[I][J] = add;x[I] += add;x[I] %= MOD;y[J] += add;y[J] %= MOD;}cur = val;curs.clear();curs.emplace_back(i, j, (1 + x[i] + y[j]) % MOD);}for (auto [I, J, add] : curs) {dp[I][J] = add;x[I] += add;x[I] %= MOD;y[J] += add;y[J] %= MOD;}int res = 0;for (int i = 0; i < n; ++i) {for (int j = 0; j < n; ++j) {res += dp[i][j];res %= MOD;}}cout << res << endl;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 |