Task: | Niitty |
Sender: | Pikaksi |
Submission time: | 2024-11-03 18:35:54 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 10 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 4 |
#2 | ACCEPTED | 6 |
#3 | TIME LIMIT EXCEEDED | 0 |
#4 | TIME LIMIT EXCEEDED | 0 |
#5 | TIME LIMIT EXCEEDED | 0 |
#6 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#4 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#5 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#6 | ACCEPTED | 0.02 s | 2, 3, 4, 5, 6 | details |
#7 | ACCEPTED | 0.01 s | 2, 3, 4, 5, 6 | details |
#8 | ACCEPTED | 0.01 s | 2, 3, 4, 5, 6 | details |
#9 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
#10 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details |
#11 | ACCEPTED | 0.97 s | 3, 4, 5, 6 | details |
#12 | ACCEPTED | 0.48 s | 3, 4, 5, 6 | details |
#13 | ACCEPTED | 0.00 s | 3, 4, 5, 6 | details |
#14 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
#15 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
#16 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
#17 | ACCEPTED | 0.01 s | 4, 5, 6 | details |
#18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#20 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#21 | ACCEPTED | 0.25 s | 5, 6 | details |
#22 | TIME LIMIT EXCEEDED | -- | 6 | details |
#23 | TIME LIMIT EXCEEDED | -- | 6 | details |
#24 | TIME LIMIT EXCEEDED | -- | 6 | details |
#25 | TIME LIMIT EXCEEDED | -- | 6 | details |
Compiler report
input/code.cpp: In function 'bool closeLeftEdge(Fence, std::array<int, 26>&)': input/code.cpp:33:51: warning: array subscript has type 'char' [-Wchar-subscripts] 33 | removedFlowers[field[fence.y + k][fence.x]] += 1; | ^ input/code.cpp: In function 'bool closeRightEdge(Fence, std::array<int, 26>&)': input/code.cpp:55:69: warning: array subscript has type 'char' [-Wchar-subscripts] 55 | removedFlowers[field[fence.y + k][fence.x + fence.sizeX - 1]] += 1; | ^ input/code.cpp: In function 'bool closeTopEdge(Fence, std::array<int, 26>&)': input/code.cpp:76:51: warning: array subscript has type 'char' [-Wchar-subscripts] 76 | removedFlowers[field[fence.y][fence.x + k]] += 1; | ^ input/code.cpp: In function 'bool closeBottomEdge(Fence, std::array<int, 26>&)': input/code.cpp:100:...
Code
#include <bits/stdc++.h> using namespace std; typedef long long ll; union Fence { struct { uint16_t x; uint16_t y; uint16_t sizeX; uint16_t sizeY; }; ll bytes; }; bool containedNumbers[26] = {0}; vector<vector<char>> field; //set<ll> elementaryFences; //vector<Fence> eFencesFinal; int n = 0; void printFence(Fence fence) { cout << fence.x << " " << fence.y << " " << fence.sizeX << " " << fence.sizeY << "\n"; } bool closeLeftEdge(Fence fence, array<int, 26>& flowerCount) { int removedFlowers[26] = {0}; for (int k = 0; k < fence.sizeY; k++) { removedFlowers[field[fence.y + k][fence.x]] += 1; } for (int k = 0; k < 26; k++) { if (containedNumbers[k] && flowerCount[k] - removedFlowers[k] <= 0) { return false; } } for (int i = 0; i < 26; i++) { if (containedNumbers[i]) { flowerCount[i] -= removedFlowers[i]; } } return true; } bool closeRightEdge(Fence fence, array<int, 26>& flowerCount) { int removedFlowers[26] = {0}; for (int k = 0; k < fence.sizeY; k++) { removedFlowers[field[fence.y + k][fence.x + fence.sizeX - 1]] += 1; } for (int k = 0; k < 26; k++) { if (containedNumbers[k] && flowerCount[k] - removedFlowers[k] <= 0) { return false; } } for (int i = 0; i < 26; i++) { if (containedNumbers[i]) { flowerCount[i] -= removedFlowers[i]; } } return true; } bool closeTopEdge(Fence fence, array<int, 26>& flowerCount) { int removedFlowers[26] = {0}; for (int k = 0; k < fence.sizeX; k++) { removedFlowers[field[fence.y][fence.x + k]] += 1; } for (int k = 0; k < 26; k++) { if (containedNumbers[k] && flowerCount[k] - removedFlowers[k] <= 0) { return false; } } for (int i = 0; i < 26; i++) { if (containedNumbers[i]) { flowerCount[i] -= removedFlowers[i]; } } return true; } bool closeBottomEdge(Fence fence, array<int, 26>& flowerCount) { int removedFlowers[26] = {0}; int y = fence.y + fence.sizeY - 1; for (int k = 0; k < fence.sizeX; k++) { removedFlowers[field[y][fence.x + k]] += 1; } for (int k = 0; k < 26; k++) { if (containedNumbers[k] && flowerCount[k] - removedFlowers[k] <= 0) { return false; } } for (int i = 0; i < 26; i++) { if (containedNumbers[i]) { flowerCount[i] -= removedFlowers[i]; } } return true; } Fence findElementaryFence(Fence fence, array<int, 26>& flowerCount) { //cout << "finding elem fence\n"; bool closeUp = true, closeDown = true, closeRight = true, closeLeft = true; while (closeUp || closeDown || closeRight || closeLeft) { if (closeUp) { closeUp = closeTopEdge(fence, flowerCount); if (closeUp) { fence.y++; fence.sizeY--; } } if (closeDown) { closeDown = closeBottomEdge(fence, flowerCount); if (closeDown) { fence.sizeY--; } } if (closeRight) { closeRight = closeRightEdge(fence, flowerCount); if (closeRight) { fence.sizeX--; } } if (closeLeft) { closeLeft = closeLeftEdge(fence, flowerCount); if (closeLeft) { fence.x++; fence.sizeX--; } } //cout << " "; printFence(fence); } return fence; } ll eFenceCombinations(Fence eFence, Fence fence) { ll ans = eFence.x - fence.x + 1LL; ans *= eFence.y - fence.y + 1LL; ans *= fence.x + fence.sizeX - (eFence.x + eFence.sizeX) + 1LL; ans *= fence.y + fence.sizeY - (eFence.y + eFence.sizeY) + 1LL; return ans; } ll combinedEFenceArea(vector<Fence>& eFences) { uint16_t u = 600, d = 0, l = 600, r = 0; for (int i = 0; i < eFences.size(); i++) { Fence fence = eFences[i]; u = min(u, fence.y); d = max(d, (uint16_t)(fence.y + fence.sizeY - (uint16_t)1)); l = min(l, fence.x); r = max(r, (uint16_t)(fence.x + fence.sizeX - (uint16_t)1)); } ll area = l + 1LL; area *= n - r; area *= u + 1LL; area *= n - d; return area; } void getFlowerCount(Fence fence, array<int, 26>& flowerCount) { //printFence(fence); for (int y = 0; y < fence.sizeY; y++) { for (int x = 0; x < fence.sizeX; x++) { flowerCount[field[fence.y + y][fence.x + x]] += 1; } } } void splitFenceAreas(Fence fence, Fence elementaryFence, vector<Fence>& outFencePos, vector<Fence>& outFenceNeg) { uint16_t r = elementaryFence.x + elementaryFence.sizeX - 1; uint16_t l = elementaryFence.x; uint16_t d = elementaryFence.y + elementaryFence.sizeY - 1; uint16_t u = elementaryFence.y; bool spaceOnR = fence.x + fence.sizeX - 1 != l; bool spaceOnL = fence.x != r; bool spaceOnD = fence.y + fence.sizeY - 1 != u; bool spaceOnU = fence.y != d; if (spaceOnL) { Fence fenceAdd = {fence.x, fence.y, r - fence.x, fence.sizeY}; outFencePos.push_back(fenceAdd); } if (spaceOnU) { Fence fenceAdd = {fence.x, fence.y, fence.sizeX, d - fence.y}; outFencePos.push_back(fenceAdd); } if (spaceOnR) { Fence fenceAdd = {elementaryFence.x + 1, fence.y, fence.x + fence.sizeX - l - 1, fence.sizeY}; outFencePos.push_back(fenceAdd); } if (spaceOnD) { Fence fenceAdd = {fence.x, elementaryFence.y + 1, fence.sizeX, fence.y + fence.sizeY - u - 1}; outFencePos.push_back(fenceAdd); } if (spaceOnL && spaceOnU) { Fence fenceAdd = {fence.x, fence.y, r - fence.x, d - fence.y}; outFenceNeg.push_back(fenceAdd); } if (spaceOnU && spaceOnR) { Fence fenceAdd = {elementaryFence.x + 1, fence.y, fence.x + fence.sizeX - l - 1, d - fence.y}; outFenceNeg.push_back(fenceAdd); } if (spaceOnR && spaceOnD) { Fence fenceAdd = {elementaryFence.x + 1, elementaryFence.y + 1, fence.x + fence.sizeX - l - 1, fence.y + fence.sizeY - u - 1}; outFenceNeg.push_back(fenceAdd); } if (spaceOnD && spaceOnL) { Fence fenceAdd = {fence.x, elementaryFence.y + 1, r - fence.x, fence.y + fence.sizeY - u - 1}; outFenceNeg.push_back(fenceAdd); } if (spaceOnL && spaceOnR && elementaryFence.sizeX >= 3) { Fence fenceAdd = {elementaryFence.x + 1, fence.y, elementaryFence.sizeX - 2, fence.sizeY}; outFenceNeg.push_back(fenceAdd); } if (spaceOnU && spaceOnD && elementaryFence.sizeY >= 3) { Fence fenceAdd = {fence.x, elementaryFence.y + 1, fence.sizeX, elementaryFence.sizeY - 2}; outFenceNeg.push_back(fenceAdd); } if (spaceOnL && spaceOnU && spaceOnR && elementaryFence.sizeX >= 3) { Fence fenceAdd = {elementaryFence.x + 1, fence.y, elementaryFence.sizeX - 2, -fence.y + elementaryFence.y + elementaryFence.sizeY - 1}; outFencePos.push_back(fenceAdd); } if (spaceOnL && spaceOnD && spaceOnR && elementaryFence.sizeX >= 3) { Fence fenceAdd = {elementaryFence.x + 1, elementaryFence.y + 1, elementaryFence.sizeX - 2, -elementaryFence.y + fence.y + fence.sizeY - 1}; outFencePos.push_back(fenceAdd); } if (spaceOnU && spaceOnL && spaceOnD && elementaryFence.sizeY >= 3) { Fence fenceAdd = {fence.x, elementaryFence.y + 1, -fence.x - 1 + elementaryFence.x + elementaryFence.sizeX, elementaryFence.sizeY - 2}; outFencePos.push_back(fenceAdd); } if (spaceOnU && spaceOnR && spaceOnD && elementaryFence.sizeY >= 3) { Fence fenceAdd = {elementaryFence.x + 1, elementaryFence.y + 1, -elementaryFence.x - 1 + fence.x + fence.sizeX, elementaryFence.sizeY - 2}; outFencePos.push_back(fenceAdd); } /*cout << "pos fences:\n"; for (Fence print : outFencePos) { printFence(print); } cout << "neg fences:\n"; for (Fence print : outFenceNeg) { printFence(print); }*/ } void splitFence(Fence fence, Fence elementaryFence, vector<Fence>& outFence) { uint16_t r = elementaryFence.x + elementaryFence.sizeX - 1; uint16_t l = elementaryFence.x; uint16_t d = elementaryFence.y + elementaryFence.sizeY - 1; uint16_t u = elementaryFence.y; if (fence.x != r) { Fence fenceAdd = {fence.x, fence.y, r - fence.x, fence.sizeY}; outFence.push_back(fenceAdd); } if (fence.y != d) { Fence fenceAdd = {fence.x, fence.y, fence.sizeX, d - fence.y}; outFence.push_back(fenceAdd); } if (fence.x + fence.sizeX - 1 != l) { Fence fenceAdd = {elementaryFence.x + 1, fence.y, fence.x + fence.sizeX - l - 1, fence.sizeY}; outFence.push_back(fenceAdd); } if (fence.y + fence.sizeY - 1 != u) { Fence fenceAdd = {fence.x, elementaryFence.y + 1, fence.sizeX, fence.y + fence.sizeY - u - 1}; outFence.push_back(fenceAdd); } } ll recursiveSplit(Fence fence, array<int, 26>& flowerCount) { Fence eFence = findElementaryFence(fence, flowerCount); ll combinations = eFenceCombinations(eFence, fence); /*cout << "split with fence = "; printFence(fence); cout << "efence = "; printFence(eFence); cout << "combinations = " << combinations << "\n";*/ vector<Fence> splitFencesPos; vector<Fence> splitFencesNeg; splitFenceAreas(fence, eFence, splitFencesPos, splitFencesNeg); //cout << "split fences = " << splitFencesPos.size() << "\n"; for (int i = 0; i < splitFencesPos.size(); i++) { array<int, 26> splitFlowerCount = {0}; getFlowerCount(splitFencesPos[i], splitFlowerCount); bool isValid = true; for (int k = 0; k < 26; k++) { if (containedNumbers[k] && splitFlowerCount[k] <= 0) { isValid = false; break; } } if (isValid) { //cout << "pos\n"; combinations += recursiveSplit(splitFencesPos[i], splitFlowerCount); } } for (int i = 0; i < splitFencesNeg.size(); i++) { array<int, 26> splitFlowerCount = {0}; getFlowerCount(splitFencesNeg[i], splitFlowerCount); bool isValid = true; for (int k = 0; k < 26; k++) { if (containedNumbers[k] && splitFlowerCount[k] <= 0) { isValid = false; break; } } if (isValid) { //cout << "neg\n"; combinations -= recursiveSplit(splitFencesNeg[i], splitFlowerCount); } } return combinations; } /*ll areaRecursive(int calls, int startIndex, vector<Fence>& fences) { ll area = 0; if (calls == 0) { area += combinedEFenceArea(fences); } for (int i = startIndex; i < eFencesFinal.size(); i++) { //cout << "recursiveLoop\n"; fences.push_back(eFencesFinal[i]); area += areaRecursive(calls - 1, i + 1, fences); fences.pop_back(); } return area; }*/ /*void calculateCombinations() { for (ll fenceBytes : elementaryFences) { Fence fence; fence.bytes = fenceBytes; eFencesFinal.push_back(fence); } ll area = 0; for (int i = 0; i < eFencesFinal.size(); i++) { //cout << "startLoop\n"; vector<Fence> fences; ll areaLoop = areaRecursive(i + 1, 0, fences); if (i & 1) { area -= areaLoop; } else { area += areaLoop; } } cout << area; }*/ ll bruteForce() { ll ans = 0; for (int x = 0; x < n; x++) { for (int y = 0; y < n; y++) { for (int z = 1; z < n - x + 1; z++) { for (int w = 1; w < n - y + 1; w++) { Fence fence = {x, y, z, w}; array<int, 26> flowerCount = {0}; getFlowerCount(fence, flowerCount); bool hasAll = true; for (int i = 0; i < 26; i++) { if (containedNumbers[i] && flowerCount[i] <= 0) { hasAll = false; break; } } if (hasAll) { ans += 1; cout << "brute force fence = "; printFence(fence); } } } } } return ans; } void shuffleField() { for (int i = 0; i < n; i++) { for (int k = 0; k < n; k++) { field[i][k] = rand() % 26; } } for (int i = 0; i < 26; i++) { containedNumbers[i] = false; } for (int i = 0; i < n; i++) { for (int k = 0; k < n; k++) { containedNumbers[field[i][k]] = true; } } } int main() { //vector<string> testField = {"AAAAA", "AAAAA", "AABAA", "AAACA", "AAADA"}; //vector<string> testField = {"BAA", "AAB", "AAA"}; //vector<string> testField = {"Z"}; //vector<string> testField = {"AZ", "ZA"}; //vector<string> testField = {"AAAK", "ABAA", "ABAA", "AAAA"}; //vector<string> testField = {"AAAAA", "AAAAA", "AAAAA", "AAAAA", "AAAAA"}; //vector<string> testField = {"ZAAAA", "AAAAA", "AAAAA", "AAAAA", "AAAAK"}; //vector<string> testField = {"AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA",}; //vector<string> testField = {"AUFCHGK","GXAPVWB","NUHYMEA","HSCSNSI","IMBMTJS","TPVRJUF","SIKDVWY"}; //n = testField.size(); cin >> n; field = vector<vector<char>>(n, vector<char>(n)); for (int i = 0; i < n; i++) { string row = ""; cin >> row; //string row = testField[i]; for (int k = 0; k < n; k++) { char value = row[k] - 'A'; field[i][k] = value; containedNumbers[value] = true; } } array<int, 26> flowerCount = {0}; for (vector<char> fieldRow : field) { for (char character : fieldRow) { flowerCount[character]++; } } Fence startFence = {0, 0, (uint16_t)n, (uint16_t)n}; ll combinations = recursiveSplit(startFence, flowerCount); cout << combinations; /*for (int test = 0; test < 1000; test++) { shuffleField(); array<int, 26> flowerCount = {0}; for (vector<char> fieldRow : field) { for (char character : fieldRow) { flowerCount[character]++; } } Fence startFence = {0, 0, (uint16_t)n, (uint16_t)n}; ll combinations = recursiveSplit(startFence, flowerCount); ll bruteForceAns = bruteForce(); if (combinations != bruteForceAns) { cout << combinations << " " << bruteForceAns << "\n"; for (vector<char> fieldRow : field) { for (char character : fieldRow) { cout << (char)(character + 'A') << " "; } cout << "\n"; } } }*/ }
Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
correct output |
---|
2035 |
user output |
---|
2035 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
correct output |
---|
9 |
user output |
---|
9 |
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
correct output |
---|
3025 |
user output |
---|
3025 |
Test 4
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
correct output |
---|
12 |
user output |
---|
12 |
Test 5
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
1 X |
correct output |
---|
1 |
user output |
---|
1 |
Test 6
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
correct output |
---|
38724 |
user output |
---|
38724 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
correct output |
---|
8334 |
user output |
---|
8334 |
Test 8
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
correct output |
---|
44100 |
user output |
---|
44100 |
Test 9
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
correct output |
---|
18 |
user output |
---|
18 |
Test 10
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
correct output |
---|
1584665 |
user output |
---|
(empty) |
Test 11
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
correct output |
---|
1077746 |
user output |
---|
1077746 |
Test 12
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
correct output |
---|
1625625 |
user output |
---|
1625625 |
Test 13
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
correct output |
---|
1680 |
user output |
---|
1680 |
Test 14
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
correct output |
---|
25325366 |
user output |
---|
(empty) |
Test 15
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
correct output |
---|
22342463 |
user output |
---|
(empty) |
Test 16
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
correct output |
---|
25502500 |
user output |
---|
(empty) |
Test 17
Group: 4, 5, 6
Verdict: ACCEPTED
input |
---|
100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
correct output |
---|
25650 |
user output |
---|
25650 |
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
correct output |
---|
403292767 |
user output |
---|
(empty) |
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
correct output |
---|
388111321 |
user output |
---|
(empty) |
Test 20
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
correct output |
---|
404010000 |
user output |
---|
(empty) |
Test 21
Group: 5, 6
Verdict: ACCEPTED
input |
---|
200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
correct output |
---|
14159445 |
user output |
---|
14159445 |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW... |
correct output |
---|
15683003812 |
user output |
---|
(empty) |
Test 23
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE... |
correct output |
---|
15575906951 |
user output |
---|
(empty) |
Test 24
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
correct output |
---|
15687562500 |
user output |
---|
(empty) |
Test 25
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW... |
correct output |
---|
3058970930 |
user output |
---|
(empty) |