CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:a256
Submission time:2022-10-31 09:27:13 +0200
Language:C++ (C++11)
Status:READY
Result:28
Feedback
groupverdictscore
#1ACCEPTED28
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.01 s2, 3details
#50.15 s2, 3details
#60.10 s2, 3details
#7ACCEPTED0.17 s3details
#8--3details
#9--3details

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;
vector<vector<ull>> rei;
set<int> luvut;
int reitit(int l, int y, int x){
int r = 1;
FOR(i, n){
if(ruu[y][i] < l)
r += rei[y][i];
}
FOR(i, n){
if(ruu[i][x] < l)
r += rei[i][x];
}
r %= MOD;
yht += r;
yht %= MOD;
return r;
}
void print_rei(){
cout << '\n';
for(auto &rivi : rei){
for(int i : rivi){
cout << i << ' ';
}
cout << '\n';
}
}
int main(){
cin >> n;
ruu.resize(n, vector<int>(n));
rei.resize(n, vector<ull>(n, 0));
FOR(i, n){
FOR(j, n){
int l;
cin >> l;
ruu[i][j] = l;
rei[i][j] = l == 1;
yht += l == 1;
luvut.insert(l);
}
}
//print_rei();
luvut.erase(1);
for(int l : luvut){
FOR(y, n){
FOR(x, n){
if(ruu[y][x] == l){
rei[y][x] = reitit(l, y, x);
}
}
}
//print_rei();
}
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: 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:

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
187458477

user output
814251718

Test 6

Group: 2, 3

Verdict:

input
100
2995 8734 1018 2513 7971 5063 ...

correct output
964692694

user output
340499849

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:

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)