| Task: | Ruudukko | 
| Sender: | Yamaxanadu | 
| Submission time: | 2022-11-03 00:00: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 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details | 
| #2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details | 
| #3 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details | 
| #4 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
#include <bits/stdc++.h>
using namespace std;
int main() {
    vector<pair<int,int>> v;
    map<int,pair<int,int>> m;
    int n, a, c, ans;
    ans = 0;
    c = 0;
    cin >> n;
    for (int i = 1; i <= n*n; i++) {
	cin >> a;
	v.push_back({a,i});
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < n*n; i++) {
	c = 1;
	for (int j = 1; j <= n*n; j++) {
	    if (m.count(j) and v[i].first != m[j].second) {
		if (max(v[i].second,j)%n == min(v[i].second,j)%n) {
		    c = c+m[j].first;
		}
		else if (j > (v[i].second-(v[i].second%n)) and j <= (v[i].second-(v[i].second%n))+n and v[i].second%n != 0) {
		    c = c+m[j].first;
		}
		else if (v[i].second%n == 0 and j <= v[i].second and j > v[i].second - n) {
		    c = c+m[j].first;
		}
	    }
	}
	m[v[i].second] = {c,v[i].first};
	ans = ans + c;
	cout << c << " ";
    }
    cout << ans;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 3 1 1 1 1 1 1 1 1 1  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 1 1 1 1 1 1 1 1 1 9 | 
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 3 1 2 3 6 5 4 7 8 9  | 
| correct output | 
|---|
| 135 | 
| user output | 
|---|
| 1 2 4 5 8 15 17 28 55 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 | 
|---|
| 1 1 2 2 5 5 5 12 24 57 | 
Test 4
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| (empty) | 
Test 5
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 1000000 | 
| user output | 
|---|
| (empty) | 
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) | 
