| Task: | Ruudukko | 
| Sender: | Laserr | 
| Submission time: | 2022-11-02 12:19:36 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 28 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #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 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.01 s | 2, 3 | details | 
| #5 | WRONG ANSWER | 0.55 s | 2, 3 | details | 
| #6 | WRONG ANSWER | 0.51 s | 2, 3 | details | 
| #7 | ACCEPTED | 0.18 s | 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
#include<iostream>
#include<vector>
#include<set>
using namespace std;
long long haku(long long i, long long j, long long k, long long n, vector<vector<pair<long long,long long>>> v) {
	long long s = 0;
	for (long long a = 0; a < n; a++) {
		if (i > v[j][a].first) {
			s += v[j][a].second;
		}
		if (i > v[a][k].first) {
			s += v[a][k].second;
		}
	}
	return s;
}
int main() {
	long long n;
	cin >> n;
	vector<vector<pair<long long, long long>>> v(n);
	long long s = 0;
	set<long long> a;
	for (long long i = 0; i < n; i++) {
		for (long long j = 0; j < n; j++) {
			long long x;
			cin >> x;
			a.insert(x);
			v[i].push_back({ x, 1});
		}
	}
	for (long long i = 1; i <= n*n; i++) {
		if (a.count(i) == 0) continue;
		for (long long j = 0; j < n; j++) {
			for (long long k = 0; k < n; k++) {
				if (v[j][k].first == i) {
					if (v[j][k].first != 1) v[j][k].second += haku(i, j, k, n, v);
					s += v[j][k].second;
				}
			}
		}	
	}
	long long mod = 1000000007;
	cout << s % mod;
}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: WRONG ANSWER
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| -611249854 | 
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| -123481215 | 
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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| (empty) | 
