| Task: | Niitty | 
| Sender: | OnniHak | 
| Submission time: | 2024-11-01 01:07:01 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| #2 | WRONG ANSWER | 0 | 
| #3 | WRONG ANSWER | 0 | 
| #4 | WRONG ANSWER | 0 | 
| #5 | WRONG ANSWER | 0 | 
| #6 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #2 | WRONG ANSWER | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #3 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #4 | WRONG ANSWER | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #5 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details | 
| #6 | WRONG ANSWER | 0.07 s | 2, 3, 4, 5, 6 | details | 
| #7 | WRONG ANSWER | 0.12 s | 2, 3, 4, 5, 6 | details | 
| #8 | ACCEPTED | 0.05 s | 2, 3, 4, 5, 6 | details | 
| #9 | WRONG ANSWER | 0.06 s | 2, 3, 4, 5, 6 | details | 
| #10 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details | 
| #11 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details | 
| #12 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 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 | TIME LIMIT EXCEEDED | -- | 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 | TIME LIMIT EXCEEDED | -- | 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 'std::set<char> getCarrots(const std::vector<std::vector<char> >&)':
input/code.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i=0; i<list.size(); i++) {
      |                   ~^~~~~~~~~~~~
input/code.cpp:45:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j=0; j<list.at(i).size(); j++) {
      |                       ~^~~~~~~~~~~~~~~~~~Code
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
std::set<char> getCarrots(const std::vector<std::vector<char>> &list);
std::vector<std::vector<char>> getSubgrid(
    const std::vector<std::vector<char>> &flowerGrid,
    int x1, int y1, int x2, int y2);
bool checkElement(const std::vector<std::vector<char>> &grid, const std::set<char> &allCars);
int getSolution(int sideLen, const std::vector<std::vector<char>> &flowerGrid);
int main() {
    int sideLen;
    char carrotInput;
    std::vector<char> nRow;
    std::vector<std::vector<char>> flowerGrid; 
    std::cin >> sideLen;
    for (int i=0; i<sideLen; i++) {
        for (int j=0; j<sideLen; j++) {
            std::cin >> carrotInput;
            nRow.push_back(carrotInput);
        }
        flowerGrid.push_back(nRow);
        nRow.clear();
    }
    int solution = getSolution(sideLen, flowerGrid);
    std::cout << solution;
    return 0;
}
std::set<char> getCarrots(const std::vector<std::vector<char>> &list) {
    std::set<char> returnSet;
    for (int i=0; i<list.size(); i++) {
        for (int j=0; j<list.at(i).size(); j++) {
            returnSet.insert(list.at(i).at(j));
        }
    }
    return returnSet;
}
std::vector<std::vector<char>> getSubgrid(
    const std::vector<std::vector<char>> &flowerGrid,
    int x1, int y1, int x2, int y2) 
{
    std::vector<std::vector<char>> returnGrid;
    std::vector<char> rowN;
    for (int col=0; col<abs(x1-x2)+1; col++) {
        for (int row=0; row<abs(y1-y2)+1; row++) {
            rowN.push_back(flowerGrid.at(row).at(col));
        }
        returnGrid.push_back(rowN);
        rowN.clear();
    }
    return returnGrid;
}
bool checkElement(const std::vector<std::vector<char>> &grid, const std::set<char> &allCars) {
    std::set<char> carSet = getCarrots(grid);
    if (carSet == allCars) return true;
    
    return false;
}
int getSolution(int sideLen, const std::vector<std::vector<char>> &flowerGrid) {
    std::set<char> allCars = getCarrots(flowerGrid), subGridCars, difference;
    std::vector<std::vector<char>> subGrid;
    int subgridAmount = 0;
    for (int startX=0; startX < sideLen; startX++) {
        for (int startY=0; startY < sideLen; startY++) {
            for (int endX=startX; endX < sideLen; endX++) {
                for (int endY=startY; endY < sideLen; endY++) {
                    subGrid = getSubgrid(flowerGrid, startX, startY, endX, endY);
                    
                    if (checkElement(subGrid, allCars)) {
                        subgridAmount++;
                    }
                }
            }
        }
    }
    return subgridAmount;
}
// muista käyttää set_differenceTest details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ...  | 
| correct output | 
|---|
| 2035 | 
| user output | 
|---|
| 1915 | 
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ...  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 10 | 
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: WRONG ANSWER
| input | 
|---|
| 10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ...  | 
| correct output | 
|---|
| 12 | 
| user output | 
|---|
| 3 | 
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: WRONG ANSWER
| input | 
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ...  | 
| correct output | 
|---|
| 38724 | 
| user output | 
|---|
| 39659 | 
Test 7
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ...  | 
| correct output | 
|---|
| 8334 | 
| user output | 
|---|
| 12513 | 
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: WRONG ANSWER
| input | 
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ...  | 
| correct output | 
|---|
| 18 | 
| user output | 
|---|
| 9 | 
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: TIME LIMIT EXCEEDED
| input | 
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...  | 
| correct output | 
|---|
| 1077746 | 
| user output | 
|---|
| (empty) | 
Test 12
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...  | 
| correct output | 
|---|
| 1625625 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...  | 
| correct output | 
|---|
| 1680 | 
| user output | 
|---|
| (empty) | 
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: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...  | 
| correct output | 
|---|
| 25650 | 
| user output | 
|---|
| (empty) | 
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: TIME LIMIT EXCEEDED
| input | 
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...  | 
| correct output | 
|---|
| 14159445 | 
| user output | 
|---|
| (empty) | 
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) | 
