Task: | Ruudukko |
Sender: | Luc |
Submission time: | 2022-11-03 11:30:18 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 61 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | RUNTIME ERROR | 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.18 s | 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 2, 3 | details |
#6 | ACCEPTED | 0.01 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.48 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result] 15 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ input/code.cpp:23:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result] 23 | scanf("%d", &t); | ~~~~~^~~~~~~~~~
Code
#include <bits/stdc++.h>using namespace std;typedef long long ll;bool cmp(const pair<int,ll> &a, const pair<int,ll> &b){return a.first<=b.first;}int main(){ll r = 0;int n, i = 0, t;scanf("%d", &n);int l = n*n;vector<pair <int, ll>> a(l);vector<pair<int,int>> c(l);while(i<l){scanf("%d", &t);a[i]={t, 1};c[i]={t, i};i++;}sort(c.begin(), c.end(), cmp);int x,y,m;i=0;while(c[i].first == 1){r++;i++;}while(i<l){m = c[i].first;t = c[i].second;x = 0;y = 0;while(x<n){if(a[((int)(t/n))*n+x].first<m) a[t].second = (a[t].second + a[((int)(t/n))*n+x].second)%1000000007ll;if(a[t%n+y*n].first<m) a[t].second = (a[t].second + a[t%n+y*n].second)%1000000007ll;x++;y++;}r = (r + a[t].second)%1000000007ll;i++;}i=0;printf("%lld", r);}// brute force every path// or store for each square what they're connected to// then brute force?// or// make eaqually large array filled with 1// for each 2 in input check possible 1s, for each a[i]+=1// for each 3 in input check possible n<3s, for each a[i]+=a[j] (j == pos of n)
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: 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: 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) |