CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:jmarttinen
Submission time:2022-11-13 23:50:04 +0200
Language:C++ (C++11)
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED28
#2ACCEPTED33
#30
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.78 s3details
#8ACCEPTED0.85 s3details
#9--3details

Code

#include <iostream>
#include <map>
#include <set>
#include <vector>
 
using namespace std;
 
using ll = long long;
 
int n;
set<pair<int,int>> allNumbers = set<pair<int,int>>();
vector<ll> counts;
vector<pair<int,ll>> rowSum;
map< int,ll> lastRowSum;
 
void countPaths(pair<int,int> x) {
	int r_num = n + x.second / n ;
	int c_num = (x.second % n);
	auto r = rowSum[r_num];
	auto c = rowSum[c_num];
	
	
	if (r.first < x.first) {
		counts[x.second] += r.second;
		if (!lastRowSum.count(r_num))
			lastRowSum[r_num] = 0;
		else 
			lastRowSum[r_num] = r.second;
	} else {
		counts[x.second] += lastRowSum[r_num];
		rowSum[r_num].second += lastRowSum[r_num];
	}
	
	if (c.first < x.first) {
		counts[x.second] += c.second;
		
		if (!lastRowSum.count(c_num))
			lastRowSum[c_num] = 0;
		else 
			lastRowSum[c_num] = c.second;

	} else {
		counts[x.second] += lastRowSum[c_num];
		rowSum[c_num].second += lastRowSum[c_num];
	}
	
	rowSum[r_num] = {x.first, counts[x.second] + r.second};
	rowSum[c_num] = {x.first, counts[x.second] + c.second};
	
	 counts[x.second] %= 1000000007;
	 rowSum[r_num].second %= 1000000007;
	 rowSum[c_num].second %= 1000000007;
	 lastRowSum[r_num] %= 1000000007;
	 lastRowSum[c_num] %= 1000000007;
}
 
 
int main() {
    cin >> n;
    counts = vector<ll>(n*n,1);
    rowSum = vector<pair<int,ll>>(2*n, {0,0});
    int k;
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            cin >> k;
            allNumbers.insert({k, n*i+j});
        }
    }
    ll total = 0;
    for (auto it = allNumbers.begin(); it != allNumbers.end(); it++) {
        countPaths(*it);
        total += counts[(*it).second];
    }
    total %= 1000000007;
 
    cout << total;
}

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)