Task: | Bittijono |
Sender: | SeveriK |
Submission time: | 2017-10-10 22:46:33 +0300 |
Language: | C++ |
Status: | READY |
Result: | 49 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 7 |
#2 | ACCEPTED | 15 |
#3 | ACCEPTED | 27 |
#4 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.08 s | 1 | details |
#3 | ACCEPTED | 0.06 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.06 s | 1 | details |
#6 | ACCEPTED | 0.05 s | 1 | details |
#7 | ACCEPTED | 0.05 s | 1 | details |
#8 | ACCEPTED | 0.04 s | 1 | details |
#9 | ACCEPTED | 0.05 s | 1 | details |
#10 | ACCEPTED | 0.05 s | 1 | details |
#11 | ACCEPTED | 0.04 s | 2 | details |
#12 | ACCEPTED | 0.07 s | 2 | details |
#13 | ACCEPTED | 0.06 s | 2 | details |
#14 | ACCEPTED | 0.05 s | 2 | details |
#15 | ACCEPTED | 0.06 s | 2 | details |
#16 | ACCEPTED | 0.06 s | 2 | details |
#17 | ACCEPTED | 0.06 s | 2 | details |
#18 | ACCEPTED | 0.05 s | 2 | details |
#19 | ACCEPTED | 0.07 s | 2 | details |
#20 | ACCEPTED | 0.06 s | 2 | details |
#21 | ACCEPTED | 0.07 s | 3 | details |
#22 | ACCEPTED | 0.05 s | 3 | details |
#23 | ACCEPTED | 0.10 s | 3 | details |
#24 | ACCEPTED | 0.05 s | 3 | details |
#25 | ACCEPTED | 0.04 s | 3 | details |
#26 | ACCEPTED | 0.05 s | 3 | details |
#27 | ACCEPTED | 0.05 s | 3 | details |
#28 | ACCEPTED | 0.08 s | 3 | details |
#29 | ACCEPTED | 0.06 s | 3 | details |
#30 | ACCEPTED | 0.06 s | 3 | details |
#31 | WRONG ANSWER | 0.08 s | 4 | details |
#32 | WRONG ANSWER | 0.04 s | 4 | details |
#33 | WRONG ANSWER | 0.05 s | 4 | details |
#34 | WRONG ANSWER | 0.06 s | 4 | details |
#35 | WRONG ANSWER | 0.04 s | 4 | details |
#36 | WRONG ANSWER | 0.05 s | 4 | details |
#37 | WRONG ANSWER | 0.05 s | 4 | details |
#38 | WRONG ANSWER | 0.07 s | 4 | details |
#39 | WRONG ANSWER | 0.05 s | 4 | details |
#40 | WRONG ANSWER | 0.06 s | 4 | details |
Code
/* #include <iostream> #include <fstream> #include <string> #include <vector> using namespace std; int main() { string rows[10]; for (int i = 0; i < 10; i++) { for (int o = 0; o < 10; o++) { int n = 0; if (i < 10 / 2) { n = i + o; } else if (i < 9) { n = i + o + 1; } else { n = i + o + 6; } while (n > 9) { n -= 10; } rows[i] += to_string(n); if (i < 9) { n = o - i; } else { n = o - i; } while (n < 0) { n += 10; } if (n == 0) { rows[i] += "A"; } else if (n == 1) { rows[i] += "B"; } else if (n == 2) { rows[i] += "C"; } else if (n == 3) { rows[i] += "D"; } else if (n == 4) { rows[i] += "E"; } else if (n == 5) { rows[i] += "F"; } else if (n == 6) { rows[i] += "G"; } else if (n == 7) { rows[i] += "H"; } else if (n == 8) { rows[i] += "I"; } else if (n == 9) { rows[i] += "J"; } if (o != 9) { rows[i] += " "; } } std::cout << rows[i] << "\n"; } ofstream myfile; myfile.open("Eppapeli.txt"); if (myfile.is_open()) { for (int i = 0; i < 10; i++) { if (i != 10 - 1) { myfile << rows[i] + "\n"; } else { myfile << rows[i]; } } myfile.close(); } int a; std::cin >> a; return 0; } }*/ #include <iostream> #include <string> #include <vector> #include <bitset> using namespace std; int main() { const int MAX_CHAR = 64; const int SEQUENCE_SIZE = 32; unsigned long long int subCount = 0; unsigned long long int i = 0; string bitSeq = "1"; unsigned long long int k; std::cin >> k; if (k > 999) { unsigned long long int l = 1; while (subCount < k) { if (l % 2) { bitSeq += '0'; } else { bitSeq += '1'; } l++; vector<unsigned long long int>last(MAX_CHAR, -1); const unsigned long long int n = bitSeq.length(); unsigned long long int* dp = new unsigned long long int[n + 1]; dp[0] = 1; for (unsigned long long int o = 1; o <= n; o++) { dp[o] = 2 * dp[o - 1]; if (last[bitSeq[o - 1]] != (unsigned long long int) - 1) { dp[o] = dp[o] - dp[last[bitSeq[o - 1]]]; } last[bitSeq[o - 1]] = (o - 1); } subCount = dp[n] - 1; } l--; if (bitSeq[l] == '1') { l--; } while (l > 0 && subCount > k) { bitSeq[l] = '1'; vector<unsigned long long int>last(MAX_CHAR, -1); const unsigned long long int n = bitSeq.length(); unsigned long long int* dp = new unsigned long long int[n + 1]; dp[0] = 1; for (unsigned long long int o = 1; o <= n; o++) { dp[o] = 2 * dp[o - 1]; if (last[bitSeq[o - 1]] != (unsigned long long int) - 1) { dp[o] = dp[o] - dp[last[bitSeq[o - 1]]]; } last[bitSeq[o - 1]] = (o - 1); } subCount = dp[n] - 1; l -= 2; } i = stoi(bitSeq, nullptr, 2); subCount = 0; } unsigned long long int tests = 540000; while (subCount != k && i < tests) { i++; bitSeq = bitset<SEQUENCE_SIZE>(i).to_string().substr(bitset<SEQUENCE_SIZE>(i).to_string().find("1", 0)); vector<unsigned long long int>last(MAX_CHAR, -1); const unsigned long long int n = bitSeq.length(); unsigned long long int* dp = new unsigned long long int[n + 1]; dp[0] = 1; for (unsigned long long int o = 1; o <= n; o++) { dp[o] = 2 * dp[o - 1]; if (last[bitSeq[o - 1]] != (unsigned long long int) - 1) { dp[o] = dp[o] - dp[last[bitSeq[o - 1]]]; } last[bitSeq[o - 1]] = (o - 1); } subCount = dp[n] - 1; } std::cout << bitSeq << "\n"; int a = 0; std::cin >> a; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
2 |
correct output |
---|
11 |
user output |
---|
11 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
10 |
user output |
---|
10 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
1111 |
user output |
---|
1111 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
5 |
correct output |
---|
110 |
user output |
---|
100 |
Test 6
Group: 1
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
101 |
user output |
---|
101 |
Test 7
Group: 1
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
1110 |
user output |
---|
1000 |
Test 8
Group: 1
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
1100 |
user output |
---|
1100 |
Test 9
Group: 1
Verdict: ACCEPTED
input |
---|
9 |
correct output |
---|
1101 |
user output |
---|
1011 |
Test 10
Group: 1
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
1001 |
user output |
---|
1001 |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
38 |
correct output |
---|
1101011 |
user output |
---|
1101011 |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
13 |
correct output |
---|
11011 |
user output |
---|
11011 |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
90 |
correct output |
---|
111001010 |
user output |
---|
100100010 |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
25 |
correct output |
---|
110010 |
user output |
---|
101100 |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
82 |
correct output |
---|
111001101 |
user output |
---|
100010011 |
Test 16
Group: 2
Verdict: ACCEPTED
input |
---|
94 |
correct output |
---|
1100011110 |
user output |
---|
1000011100 |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
100 |
correct output |
---|
1111001001 |
user output |
---|
1001001111 |
Test 18
Group: 2
Verdict: ACCEPTED
input |
---|
99 |
correct output |
---|
110010010 |
user output |
---|
100011010 |
Test 19
Group: 2
Verdict: ACCEPTED
input |
---|
98 |
correct output |
---|
110110010 |
user output |
---|
100111010 |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
92 |
correct output |
---|
100110001 |
user output |
---|
100011001 |
Test 21
Group: 3
Verdict: ACCEPTED
input |
---|
1666 |
correct output |
---|
101101100100101 |
user output |
---|
101010101110110 |
Test 22
Group: 3
Verdict: ACCEPTED
input |
---|
897 |
correct output |
---|
11101001101010 |
user output |
---|
10100010110100 |
Test 23
Group: 3
Verdict: ACCEPTED
input |
---|
4466 |
correct output |
---|
111101010110100101 |
user output |
---|
101001001110001011 |
Test 24
Group: 3
Verdict: ACCEPTED
input |
---|
4240 |
correct output |
---|
11011001011010101 |
user output |
---|
10101011010011011 |
Test 25
Group: 3
Verdict: ACCEPTED
input |
---|
3089 |
correct output |
---|
1011001010100101 |
user output |
---|
1011001010100101 |
Test 26
Group: 3
Verdict: ACCEPTED
input |
---|
4697 |
correct output |
---|
11010101101010110 |
user output |
---|
10101101101101010 |
Test 27
Group: 3
Verdict: ACCEPTED
input |
---|
4608 |
correct output |
---|
11010110101001010 |
user output |
---|
10101101010010100 |
Test 28
Group: 3
Verdict: ACCEPTED
input |
---|
4625 |
correct output |
---|
111011001100101001 |
user output |
---|
100010101110110110 |
Test 29
Group: 3
Verdict: ACCEPTED
input |
---|
4611 |
correct output |
---|
11010101010101100 |
user output |
---|
10101101011010100 |
Test 30
Group: 3
Verdict: ACCEPTED
input |
---|
4917 |
correct output |
---|
10110100101010110 |
user output |
---|
10110100101010110 |
Test 31
Group: 4
Verdict: WRONG ANSWER
input |
---|
178555 |
correct output |
---|
1011010110110101010110110 |
user output |
---|
101010101010101010101011 |
Test 32
Group: 4
Verdict: WRONG ANSWER
input |
---|
864856 |
correct output |
---|
10111010110110100100101010010 |
user output |
---|
1010101010101010101010101111 |
Test 33
Group: 4
Verdict: WRONG ANSWER
input |
---|
112146 |
correct output |
---|
1101110101011001100100110 |
user output |
---|
10101010101010101010111 |
Test 34
Group: 4
Verdict: WRONG ANSWER
input |
---|
741124 |
correct output |
---|
1011010011010101100101011010 |
user output |
---|
101010101010101010101010111 |
Test 35
Group: 4
Verdict: WRONG ANSWER
input |
---|
511902 |
correct output |
---|
1011010100011010100101001110 |
user output |
---|
10101010101010101010101011 |
Test 36
Group: 4
Verdict: WRONG ANSWER
input |
---|
920019 |
correct output |
---|
11100100101101010101001101010 |
user output |
---|
1010101010101010101010101111 |
Test 37
Group: 4
Verdict: WRONG ANSWER
input |
---|
933943 |
correct output |
---|
10101011010100100110100111001 |
user output |
---|
1010101010101010101010101111 |
Test 38
Group: 4
Verdict: WRONG ANSWER
input |
---|
973410 |
correct output |
---|
1011010101011010101010101001 |
user output |
---|
1010101010101010101010101111 |
Test 39
Group: 4
Verdict: WRONG ANSWER
input |
---|
954943 |
correct output |
---|
10110110010011010100100110101 |
user output |
---|
1010101010101010101010101111 |
Test 40
Group: 4
Verdict: WRONG ANSWER
input |
---|
911674 |
correct output |
---|
1010110010110101010101010110 |
user output |
---|
1010101010101010101010101111 |