| Task: | Ruudukko |
| Sender: | Kemm1706 |
| Submission time: | 2022-12-04 07:33:55 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | RUNTIME ERROR | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.03 s | 1, 2, 3 | details |
| #2 | RUNTIME ERROR | 0.03 s | 1, 2, 3 | details |
| #3 | RUNTIME ERROR | 0.03 s | 1, 2, 3 | details |
| #4 | RUNTIME ERROR | 0.03 s | 2, 3 | details |
| #5 | RUNTIME ERROR | 0.03 s | 2, 3 | details |
| #6 | RUNTIME ERROR | 0.03 s | 2, 3 | details |
| #7 | RUNTIME ERROR | 0.03 s | 3 | details |
| #8 | RUNTIME ERROR | 0.03 s | 3 | details |
| #9 | RUNTIME ERROR | 0.03 s | 3 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
20 | freopen("test_input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~Code
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL modd = 1e9 + 7;
struct Item
{
LL val, x, y;
};
bool SoSanh(Item a, Item b)
{
return a.val > b.val;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
freopen("test_input.txt", "r", stdin);
LL n, i, j, m = 0, x, y, ans = 0, k;
static Item a[1000000];
//static LL countt[100][100];
static LL r[1000];
static LL c[1000];
cin >> n;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
{
cin >> a[m].val;
a[m].x = i;
a[m].y = j;
m++;
}
sort(a, a + m, SoSanh);
i = j = 0;
n *= n;
while(i < n)
{
vector <pair<LL, LL>> dr;
vector <pair<LL, LL>> dc;
while(a[j].val == a[i].val && j < n)
{
x = a[j].x;
y = a[j].y;
k = (r[x] + c[y] + 1) % modd;
dr.push_back({x, k});
dc.push_back({y, k});
ans += k;
ans %= modd;
//cout << "\n" << x << " " << y << " " << ans;
j++;
}
m = dr.size();
for(i = 0; i < m; i++)
{
r[dr[i].first] += dr[i].second;
r[dr[i].first] %= modd;
}
m = dc.size();
for(i = 0; i < m; i++)
{
c[dc[i].first] += dc[i].second;
c[dc[i].first] %= modd;
}
//cout << " " << r[x] << " " << c[y] << ".";
i = j;
}
/*for(i = 0; i < sqrt(n); i++)
cout << r[i] << " " << c[i] << "\n\n";*/
cout << ans;
return 0;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 3 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 9 |
| user output |
|---|
| (empty) |
Test 2
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 3 1 2 3 6 5 4 7 8 9 |
| correct output |
|---|
| 135 |
| user output |
|---|
| (empty) |
Test 3
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 3 7 8 1 4 5 4 3 9 6 |
| correct output |
|---|
| 57 |
| user output |
|---|
| (empty) |
Test 4
Group: 2, 3
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| (empty) |
Test 7
Group: 3
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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: RUNTIME ERROR
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
