| Task: | Ruudukko |
| Sender: | Lordoa |
| Submission time: | 2022-11-09 11:16:15 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 28 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 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 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #6 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #7 | ACCEPTED | 0.08 s | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string.h>
#include <cctype>
#include <algorithm>
#include <array>
int n;
int arr[1001][1001];
//std::array<std::string, 1001> arr;
int gps[1001][1001]={0};
int route(int x, int y){
if (gps[x][y]!=0)
return gps[x][y];
if (arr[x][y]==1)
return 1;
int routes = 1;
for (int i=0;i<n;i++){
if (arr[x][i]<arr[x][y])
routes += route(x,i);
if (arr[i][y]<arr[x][y])
routes += route(i,y);
}
gps[x][y] = routes;
return routes;
}
int main(){
std::cin.sync_with_stdio(false);
std::string raw_n;
std::getline(std::cin, raw_n);
n = stoi(raw_n);
std::string tmp;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
std::cin >> arr[i][j];
}
/*
std::cin >> arr[i];
std::getline(std::cin, tmp);
tmp.erase(std::remove_if(tmp.begin(), tmp.end(),::isspace),tmp.end());
arr[i] = tmp;
*/
}
/*
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
std::cout << arr[i][j];
}
std::cout << "\n";
}
*/
int sum = 0;
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
sum += route(i,j);
}
}
std::cout << sum << "\n";
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: 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: WRONG ANSWER
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| 348370085 |
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) |
