Task: | Käännöt |
Sender: | |
Submission time: | 2015-11-07 20:50:09 +0200 |
Language: | C++ |
Status: | READY |
Result: | 56 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 15 |
#2 | ACCEPTED | 41 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.06 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.40 s | 2 | details |
#7 | ACCEPTED | 0.40 s | 2 | details |
#8 | ACCEPTED | 0.41 s | 2 | details |
#9 | ACCEPTED | 0.40 s | 2 | details |
#10 | ACCEPTED | 0.40 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <vector> #include <map> #include <cmath> #include <utility> #include <set> using namespace std; typedef long long LL; string s; LL n; LL mod = 1e9 + 7; vector<LL> p10; LL f(LL i){ LL ans = 0; for(LL p = 0; p <= n-1; p++){ LL involved; if(i + p < n) involved = min(i+1,p+1); else involved = min(n-i, n-p); LL not_involved = ((p*p - p)/2 + p + (i*i - i)/2 + i); ans = (ans + p10[p] * (s[i]-'0') * involved) % mod; if(i + p == n-1) ans = (ans + (p10[p] * (s[i]-'0')) * not_involved) % mod; } return ans; } int main(){ cin.tie(0); ios_base::sync_with_stdio(0); cin >> s; n = s.size(); p10.push_back(1); for(int i = 1; i < n + 100; i++){ p10.push_back((p10.back()*10) % mod); } LL ans = 0; for(int i = 0; i < n; i++) ans = (ans + f(i)) % mod; cout << ans << endl; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
825864589849478186996872119675... |
correct output |
---|
457966376 |
user output |
---|
457966376 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
191658935877461356157657491987... |
correct output |
---|
176954270 |
user output |
---|
176954270 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
348988594526165698179722696175... |
correct output |
---|
338693404 |
user output |
---|
338693404 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
959161872742625799336943933597... |
correct output |
---|
585928712 |
user output |
---|
585928712 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
925429363246698689162197257943... |
correct output |
---|
517617697 |
user output |
---|
517617697 |
Test 6
Group: 2
Verdict: ACCEPTED
input |
---|
972591294933975999938266397628... |
correct output |
---|
667001154 |
user output |
---|
667001154 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
275688881195265674233697529772... |
correct output |
---|
213272855 |
user output |
---|
213272855 |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
654678934762543351831648468742... |
correct output |
---|
465477034 |
user output |
---|
465477034 |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
852895263384279396767531876338... |
correct output |
---|
225052500 |
user output |
---|
225052500 |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
257723665884149498894428498943... |
correct output |
---|
169577498 |
user output |
---|
169577498 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
965391619923528543348143963721... |
correct output |
---|
458795777 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
934996116481518541954869782274... |
correct output |
---|
38884659 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
356521595763548549682719476371... |
correct output |
---|
335143519 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
691571977153731228387836644955... |
correct output |
---|
504860195 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
882254176987218851832315176774... |
correct output |
---|
32749477 |
user output |
---|
(empty) |