| Task: | Niitty | 
| Sender: | Lytsky | 
| Submission time: | 2024-10-31 16:57:13 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | RUNTIME ERROR | 0 | 
| #2 | RUNTIME ERROR | 0 | 
| #3 | RUNTIME ERROR | 0 | 
| #4 | RUNTIME ERROR | 0 | 
| #5 | RUNTIME ERROR | 0 | 
| #6 | RUNTIME ERROR | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.00 s | 1, 2, 3, 4, 5, 6 | details | 
| #2 | RUNTIME ERROR | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #3 | RUNTIME ERROR | 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 | RUNTIME ERROR | 0.00 s | 2, 3, 4, 5, 6 | details | 
| #7 | RUNTIME ERROR | 0.01 s | 2, 3, 4, 5, 6 | details | 
| #8 | RUNTIME ERROR | 0.00 s | 2, 3, 4, 5, 6 | details | 
| #9 | RUNTIME ERROR | 0.01 s | 2, 3, 4, 5, 6 | details | 
| #10 | RUNTIME ERROR | 0.01 s | 3, 4, 5, 6 | details | 
| #11 | RUNTIME ERROR | 0.02 s | 3, 4, 5, 6 | details | 
| #12 | RUNTIME ERROR | 0.01 s | 3, 4, 5, 6 | details | 
| #13 | RUNTIME ERROR | 0.02 s | 3, 4, 5, 6 | details | 
| #14 | RUNTIME ERROR | 0.02 s | 4, 5, 6 | details | 
| #15 | RUNTIME ERROR | 0.08 s | 4, 5, 6 | details | 
| #16 | RUNTIME ERROR | 0.01 s | 4, 5, 6 | details | 
| #17 | RUNTIME ERROR | 0.09 s | 4, 5, 6 | details | 
| #18 | RUNTIME ERROR | 0.07 s | 5, 6 | details | 
| #19 | RUNTIME ERROR | 0.36 s | 5, 6 | details | 
| #20 | RUNTIME ERROR | 0.03 s | 5, 6 | details | 
| #21 | RUNTIME ERROR | 0.37 s | 5, 6 | details | 
| #22 | RUNTIME ERROR | 0.40 s | 6 | details | 
| #23 | TIME LIMIT EXCEEDED | -- | 6 | details | 
| #24 | RUNTIME ERROR | 0.16 s | 6 | details | 
| #25 | TIME LIMIT EXCEEDED | -- | 6 | details | 
Code
#include <bits/stdc++.h>
using namespace std;
map<char, long> setUnion(map<char, long> a, map<char, long> b) {
    for (auto x : a) { 
        b[x.first] += x.second;
    }
    return b;
}
map<char, long> setMinus(map<char, long> a, map<char, long> b) {
    for (auto x : b) { 
        a[x.first] -= x.second;
    }
    return a;
}
int main() {
    long n, answer = 0;
    char flower;
    cin >> n;
    map<char, long> plus, now, species;
    vector<map<char, long>> sums;
    for (long index = 0; index < n*n; index++) {
        plus.clear();
        cin >> flower;
        if (not species[flower]) species[flower] = 1;
        map<char, long> m;
        m[flower] = 1;
        sums.push_back(m);
        if (index != 0) {
            if (index%n > 0) sums[index] = setUnion(sums[index-1], sums[index]);
            if (index >= n) sums[index] = setUnion(sums[index-n], sums[index]);
            if (index%n > 0 and index >= n) sums[index] = setMinus(sums[index], sums[((index-n)/n)*n + (index-1)%n]);
        }
    }
    for (long index = 0; index < n*n; index++) {
        long lensumsi = 0;
        for (auto specie : species) { 
            if (sums[index][specie.first]) lensumsi++;
        }
        if (lensumsi == (long) species.size()) {
            map<char, long> big = sums[index];
            //vasen 
            for (long vasen = 0; vasen <= index % n; vasen++) {
                //ylä
                for (long yla = (index)/n + 1; yla > 0; yla--) {
                    if (index - yla*n >= 0) {
                        long plusi = index - yla*n - (n - ((index-vasen+1) % n));
                        map<char, long> s = sums[index];
                        if (vasen != 0) {
                            s = setMinus(s, sums[index - vasen]);
                            s = setUnion(sums[plusi], s);
                        }
                        s = setMinus(s, sums[index - yla*n]);
                        bool through = true;
                        for (auto x : species) {
                            if (s[x.first] <= 0) {
                                through = false;
                                break;
                            }
                        }
                        if (through and (long) s.size() == (long) sums[index].size()) {
                            answer++;
                        }
                    } else {
                        map<char, long> s = sums[index];
                        if (vasen != 0) s = setMinus(s, sums[index - vasen]);
                        bool through = true;
                        for (auto x : species) {
                            if (s[x.first] <= 0) {
                                through = false;
                                break;
                            }
                        }
                        if (through) {
                            answer++;
                        }
                    }
                }
            }
        }
    }
    cout << answer << endl; 
}
Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ...  | 
| correct output | 
|---|
| 2035 | 
| user output | 
|---|
| (empty) | 
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ...  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| (empty) | 
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ...  | 
| correct output | 
|---|
| 3025 | 
| user output | 
|---|
| (empty) | 
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: RUNTIME ERROR
| input | 
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ...  | 
| correct output | 
|---|
| 38724 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ...  | 
| correct output | 
|---|
| 8334 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ...  | 
| correct output | 
|---|
| 44100 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 2, 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ...  | 
| correct output | 
|---|
| 18 | 
| user output | 
|---|
| (empty) | 
Test 10
Group: 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...  | 
| correct output | 
|---|
| 1584665 | 
| user output | 
|---|
| (empty) | 
Test 11
Group: 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...  | 
| correct output | 
|---|
| 1077746 | 
| user output | 
|---|
| (empty) | 
Test 12
Group: 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...  | 
| correct output | 
|---|
| 1625625 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 3, 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...  | 
| correct output | 
|---|
| 1680 | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...  | 
| correct output | 
|---|
| 25325366 | 
| user output | 
|---|
| (empty) | 
Test 15
Group: 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG...  | 
| correct output | 
|---|
| 22342463 | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...  | 
| correct output | 
|---|
| 25502500 | 
| user output | 
|---|
| (empty) | 
Test 17
Group: 4, 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...  | 
| correct output | 
|---|
| 25650 | 
| user output | 
|---|
| (empty) | 
Test 18
Group: 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...  | 
| correct output | 
|---|
| 403292767 | 
| user output | 
|---|
| (empty) | 
Test 19
Group: 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...  | 
| correct output | 
|---|
| 388111321 | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...  | 
| correct output | 
|---|
| 404010000 | 
| user output | 
|---|
| (empty) | 
Test 21
Group: 5, 6
Verdict: RUNTIME ERROR
| input | 
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...  | 
| correct output | 
|---|
| 14159445 | 
| user output | 
|---|
| (empty) | 
Test 22
Group: 6
Verdict: RUNTIME ERROR
| 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: RUNTIME ERROR
| 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) | 
