Task: | Ruudukko |
Sender: | a256 |
Submission time: | 2022-10-31 16:56:09 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#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 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#7 | ACCEPTED | 0.17 s | 3 | details |
#8 | ACCEPTED | 0.61 s | 3 | details |
#9 | WRONG ANSWER | 0.80 s | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(decltype(n) i=0;i<(n);++i) #define FORI(i, s, n) for(decltype(n) i=(s);i<(n);++i) #define BE(t) t.begin(), t.end() #define RBE(t) t.rbegin(), t.rend() #define evn(n) (!((n) & 1)) #define PB push_back #define MP(f, s) make_pair((f), (s)) #define F first #define S second #define pmod(a, m) ((a)%(m)+(m))%(m) typedef unsigned long long ull; typedef long long ll; #define MOD ((int)1e9+7) #define CEILDIV(a, b) (((a)-1)/(b)+1) int n; ull yht = 0; vector<vector<int>> ruu, rei; vector<int> pysty, vaaka, uv, up; typedef pair<int,pair<int,int>> ppi; priority_queue<ppi, vector<ppi>, greater<ppi>> q; void print_rei(){ cout << '\n'; cout << "vaaka: "; for(int i : vaaka){ cout << i << ' '; } cout << '\n'; cout << "pysty: "; for(int i : pysty){ cout << i << ' '; } cout << '\n'; FOR(y, n){ FOR(x, n){ cout << rei[y][x] << ' '; } cout << '\n'; } } int main(){ cin >> n; ruu.resize(n, vector<int>(n)); rei.resize(n+1, vector<int>(n)); vaaka.resize(n); pysty.resize(n); FOR(y, n){ FOR(x, n){ int l; cin >> l; ruu[y][x] = l; if(ruu[y][x] == 1){ rei[y][x] = 1; pysty[x] += 1; vaaka[y] += 1; } else { q.push(MP(l, MP(y, x))); } } } uv = vaaka; up = pysty; int lv; if(q.size()) lv = q.top().F; //print_rei(); while(q.size()){ auto p = q.top(); int value = p.F; q.pop(); if(value != lv){ pysty = up; vaaka = uv; //print_rei(); } auto coord = p.S; int y = coord.F, x = coord.S; int av = (vaaka[y]+pysty[x]+1) % MOD; rei[y][x] = av; uv[y] += av; uv[y] %= MOD; up[x] += av; up[x] %= MOD; } //print_rei(); FOR(y, n){ FOR(x, n){ yht += rei[y][x]; yht %= MOD; } } cout << yht << '\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: WRONG ANSWER
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
71 |
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: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
483007256 |
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: WRONG ANSWER
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
611575814 |