Task: | Kertoma |
Sender: | Mariia |
Submission time: | 2022-11-11 17:57:04 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 46 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 22 |
#2 | ACCEPTED | 24 |
#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.00 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#7 | ACCEPTED | 0.01 s | 2, 3 | details |
#8 | ACCEPTED | 0.01 s | 2, 3 | details |
#9 | ACCEPTED | 0.01 s | 2, 3 | details |
#10 | ACCEPTED | 0.02 s | 2, 3 | 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 |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'std::vector<int> mult(ll, std::vector<int>)': input/code.cpp:17:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 17 | for (int i = 0; i < f[I].size(); i++) { | ~~^~~~~~~~~~~~~ input/code.cpp:18:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 18 | for (int j = 0; j < y.size(); j++) { | ~~^~~~~~~~~~
Code
#include <iostream>#include <vector>#include <cmath>#include <algorithm>using namespace std;typedef unsigned long long ll;vector<vector<int>> f(10001, {0});vector<int> mult(ll I, vector<int> y) {//reverse(x.begin(), x.end());//reverse(y.begin(), y.end());vector<int> ans(f[I].size() + y.size() + 2, 0);for (int i = 0; i < f[I].size(); i++) {for (int j = 0; j < y.size(); j++) {int summi = f[I][i] * y[j];ans[i + j] += summi;ans[i + j + 1] += (ans[i + j] / 10);ans[i + j] %= 10;}}while (ans.size() > 1 && ans.back() == 0) {ans.pop_back();}//reverse(ans.begin(), ans.end());return ans;}vector<int> make_arr(ll x) {vector<int> ans;while (x > 0) {ans.push_back(x % 10);x /= 10;}//reverse(ans.begin(), ans.end());return ans;}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++) {f[i] = mult(i - 1, make_arr(i));}}}ll len(ll x) {return f[x].size();}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);}if (dig <= 158) {ll L = 1;ll R = 100;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 <= 2568) {ll L = 100;ll R = 1000;while (R - L > 1) {ll M = (L + R) / 2;fact(M);if (len(M) < dig) {L = M;} else {R = M;}}cout << R;} else {ll L = 1000;ll R = 8000;while (R - L > 1) {ll M = (L + R) / 2;fact(M);if (len(M) < dig) {L = M;} else {R = M;}}cout << R;}}
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: TIME LIMIT EXCEEDED
input |
---|
3419 1797 1845 1849 1879 1791 ... |
correct output |
---|
5959 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
4776 2695 2709 2781 2616 2753 ... |
correct output |
---|
8391 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
20097 12282 12229 12214 12406 ... |
correct output |
---|
32001 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
47934 29918 29878 29713 29984 ... |
correct output |
---|
71718 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
84691 54156 54277 54533 54296 ... |
correct output |
---|
123123 |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
99098 63339 63878 64182 63904 ... |
correct output |
---|
142663 |
user output |
---|
(empty) |