CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:Mariia
Submission time:2022-11-13 21:32:01 +0200
Language:C++ (C++11)
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.24 s1, 2, 3details
#2ACCEPTED0.24 s1, 2, 3details
#3ACCEPTED0.24 s1, 2, 3details
#4ACCEPTED0.24 s1, 2, 3details
#5ACCEPTED0.24 s1, 2, 3details
#6ACCEPTED0.24 s1, 2, 3details
#7ACCEPTED0.24 s2, 3details
#8ACCEPTED0.24 s2, 3details
#9ACCEPTED0.24 s2, 3details
#10ACCEPTED0.24 s2, 3details
#11ACCEPTED0.47 s3details
#12ACCEPTED0.69 s3details
#130.90 s3details
#140.90 s3details
#150.75 s3details
#160.76 s3details

Compiler report

input/code.cpp: In function 'void mult(ll, ll)':
input/code.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < xsize || c; i++) {
      |                     ~~^~~~~~~
input/code.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   19 |         if (i == xsize) {
      |             ~~^~~~~~~~

Code

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef unsigned long long ll;
vector<vector<int>> f(1000001, {0});
void mult(ll t, ll y) {
const ll base = 1e9;
ll xsize = f[t].size();
f[t + 1].resize(xsize);
ll c = 0;
for (int i = 0; i < xsize || c; i++) {
if (i == xsize) {
f[t].push_back(0);
f[t + 1].push_back(0);
}
ll summi = f[t][i] * y + c;
c = summi / base;
f[t + 1][i] = summi - base * c;
}
/*while (f[t + 1].size() > 1 && f[t + 1].back() == 0) {
f[t + 1].pop_back();
} */
}
void fact(ll x) {
f[0] = {1};
if (f[x][0] == 0) {
ll start = x;
while (f[start][0] == 0) {
start--;
}
for (ll i = start + 1; i <= x; i++) {
mult(i - 1, i);
}
}
}
ll len(ll x) {
ll ans = 0;
for (int i = f[x].size() - 2; i >= 0; i--) {
ans += 9;
}
ll a = f[x][f[x].size() - 1];
while (a > 0) {
a /= 10;
ans++;
}
return ans;
}
int main() {
vector<ll> cnt(10);
ll dig = 0;
ll sum = 0;
for (int i = 0; i < 10; i++) {
cin >> cnt[i];
dig += cnt[i];
sum += (cnt[i] * i);
}
fact(10000);
// cout << len(10000);
if (dig <= 356605) {
ll L = 1;
ll R = 10000;
while (R - L > 1) {
ll M = (L + R) / 2;
fact(M);
if (len(M) < dig) {
L = M;
} else {
R = M;
}
}
if (R == 5 || R == 6) {
if (sum == 3) {
cout << 5;
} else {
cout << 6;
}
} else if (R == 2 || R == 3) {
if (sum == 2) {
cout << 2;
} else {
cout << 3;
}
} else {
cout << R;
}
} else if (dig < 506784) {
ll d = 10000 + (dig - 356605) / 4;
fact(d + 3);
if (len(d + 3) == dig) {
cout << d + 3;
} else if (len(d + 2) == dig) {
cout << d + 2;
} else if (len(d + 1) == dig) {
cout << d + 1;
} else if (len(d) == dig) {
cout << d;
} else if (len(d - 1) == dig) {
cout << d - 1;
} else if (len(d - 2) == dig) {
cout << d - 2;
} else {
cout << d - 3;
}
} else {
ll d = 110000 + (dig - 506784) / 5;
fact(d + 4);
if (len(d + 4) == dig) {
cout << d + 4;
} else if (len(d + 3) == dig) {
cout << d + 3;
} else if (len(d + 2) == dig) {
cout << d + 2;
} else if (len(d + 1) == dig) {
cout << d + 1;
} else if (len(d) == dig) {
cout << d;
} else if (len(d - 1) == dig) {
cout << d - 1;
} else if (len(d - 2) == dig) {
cout << d - 2;
} else if (len(d - 3) == dig) {
cout << d - 3;
} else {
cout << d - 4;
}
}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 0 0 0 0 0 0

correct output
2

user output
2

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 0 0 0 0 1 0 0 0

correct output
3

user output
3

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
0 0 1 0 1 0 0 0 0 0

correct output
4

user output
4

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
2 0 1 1 0 0 1 0 2 0

correct output
10

user output
10

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
9 3 1 1 2 2 3 1 6 1

correct output
27

user output
27

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4 3 4 3 2 2 4 3 7

correct output
36

user output
36

Test 7

Group: 2, 3

Verdict: ACCEPTED

input
71 53 36 30 25 29 42 24 34 29

correct output
199

user output
199

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
71 33 46 38 27 45 36 21 35 35

correct output
205

user output
205

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
93 38 35 26 43 54 38 25 41 34

correct output
222

user output
222

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
100 33 33 45 36 43 38 54 56 36

correct output
242

user output
242

Test 11

Group: 3

Verdict: ACCEPTED

input
3419 1797 1845 1849 1879 1791 ...

correct output
5959

user output
5959

Test 12

Group: 3

Verdict: ACCEPTED

input
4776 2695 2709 2781 2616 2753 ...

correct output
8391

user output
8391

Test 13

Group: 3

Verdict:

input
20097 12282 12229 12214 12406 ...

correct output
32001

user output
10000

Test 14

Group: 3

Verdict:

input
47934 29918 29878 29713 29984 ...

correct output
71718

user output
10000

Test 15

Group: 3

Verdict:

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
(empty)

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
(empty)