CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:Kemm1706
Submission time:2025-01-12 16:59:36 +0200
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED28
#2ACCEPTED33
#3ACCEPTED39
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.01 s2, 3details
#5ACCEPTED0.01 s2, 3details
#6ACCEPTED0.01 s2, 3details
#7ACCEPTED0.21 s3details
#8ACCEPTED0.30 s3details
#9ACCEPTED0.35 s3details

Compiler report

input/code.cpp: In function 'void equalize(std::queue<std::pair<long long int, long long int> >&, vl&)':
input/code.cpp:25:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |         auto [p, v] = cc.front(); cc.pop();
      |              ^

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
const ll modd = 1e9 + 7;
struct item
{
ll v, x, y;
};
typedef vector <item> vi;
bool ss(item a, item b)
{
return a.v < b.v;
}
void equalize(queue <pl> &cc, vl &c)
{
while(!cc.empty())
{
auto [p, v] = cc.front(); cc.pop();
c[p] = (c[p] + v) % modd;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
ll n, i, j, cur = -1, k = 0, s;
cin >> n;
vi a(n * n);
queue <pl> cc, rr;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
cin >> a[k].v;
a[k].x = i; a[k].y = j;
k++;
}
sort(a.begin(), a.end(), ss);
vl r(n), c(n);
for(i = 0; i < k; i++)
{
if(a[i].v != cur)
{
equalize(cc, c); equalize(rr, r);
cur = a[i].v;
}
s = (r[a[i].x] + c[a[i].y] + 1) % modd;
rr.push({a[i].x, s}); cc.push({a[i].y, s});
}
equalize(cc, c); equalize(rr, r);
k = 0;
for(i = 0; i < n; i++)
k = (k + c[i] + r[i]) % modd;
k = (modd + 1) / 2 * k % modd;
cout << k;
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