| Task: | Niitty | 
| Sender: | PMak | 
| Submission time: | 2024-10-31 12:52:39 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 33 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 4 | 
| #2 | ACCEPTED | 6 | 
| #3 | ACCEPTED | 10 | 
| #4 | ACCEPTED | 13 | 
| #5 | TIME LIMIT EXCEEDED | 0 | 
| #6 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #2 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #3 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #4 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #5 | ACCEPTED | 0.01 s | 1, 2, 3, 4, 5, 6 | details | 
| #6 | ACCEPTED | 0.01 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.01 s | 2, 3, 4, 5, 6 | details | 
| #10 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details | 
| #11 | ACCEPTED | 0.05 s | 3, 4, 5, 6 | details | 
| #12 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details | 
| #13 | ACCEPTED | 0.07 s | 3, 4, 5, 6 | details | 
| #14 | ACCEPTED | 0.05 s | 4, 5, 6 | details | 
| #15 | ACCEPTED | 0.28 s | 4, 5, 6 | details | 
| #16 | ACCEPTED | 0.04 s | 4, 5, 6 | details | 
| #17 | ACCEPTED | 0.95 s | 4, 5, 6 | details | 
| #18 | ACCEPTED | 0.32 s | 5, 6 | details | 
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details | 
| #20 | ACCEPTED | 0.24 s | 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:22:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   22 | void print(vector<auto> v) {
      |                   ^~~~Code
#include <bits/stdc++.h>
#define F0R(i, n) for (i=0; i<n; i++)
#define FOR(i, from, to) for (i = from; i < to; i++)
#define R0F(n) for (int i = n; i>=0; --i)
#define ROF(from, to) for (int i = from; i >= to; --i)
#define ll long long
#define mod (int) (1e9 + 7)
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define pii pair<int, int>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
void print(vector<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
	cout << "\n";
}
vector<vi> adj(int(1e5+1), vi());
vi vis(int(1e5+1));
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, i, j, k, a, b;
    ll ans = 0ll;
    char t;
    cin >> n;
    vector<vi> grid(n, vi(n, 0));
    set<int> chars;
    F0R(i, n) {
        F0R (j, n) {
            cin >> t;
            grid[i][j] = int(t-'A');
            chars.insert(int(t-'A'));
        }
    }
    //for (auto v : grid)
    //    print(v);
    vector<vector<vi>> dp(n, vector<vi>(n, vi(26, 0)));
    F0R (i, n) {
        F0R (j, n) {
            F0R (k, 26) {
                if (i == 0 && j == 0)
                    dp[i][j][k] = (grid[i][j] == k);
                else if (i == 0)
                    dp[i][j][k] = dp[i][j-1][k] + (grid[i][j] == k);
                else if (j == 0)
                    dp[i][j][k] = dp[i-1][j][k] + (grid[i][j] == k);
                else
                    dp[i][j][k] = dp[i-1][j][k] + dp[i][j-1][k] - dp[i-1][j-1][k] + (grid[i][j] == k);
            }
            // printf("(%d, %d), A=%d, B=%d, K=%d\n", i, j, dp[i][j][0], dp[i][j][1], dp[i][j][10]);
        }
    }
    bool all = false;
    vi c(26, 0);
    F0R (i, n) {
        F0R (j, n) {
            FOR (a, i, n) {
                FOR (b, j, n) {
                    fill(c.begin(), c.end(), 0);
                    all = true;
                    if (i == 0 && j == 0) {
                        F0R (k, 26)
                            c[k] = dp[a][b][k];
                    }
                    else if (i == 0) {
                        F0R (k, 26)
                            c[k] = dp[a][b][k] - dp[a][j-1][k];
                    }
                    else if (j == 0) {
                        F0R (k, 26)
                         c[k] = dp[a][b][k] - dp[i-1][b][k];
                    }
                    else {
                        F0R (k, 26) {
                            c[k] = dp[a][b][k] - (dp[i-1][b][k] + dp[a][j-1][k] - dp[i-1][j-1][k]);
                        }
                    }
                    // print(c);
                    for (int x : chars) {
                        if (c[x] <= 0) {
                            all = false;
                            break;
                        }
                    }
                    if (all) {
                        ans += n-b;
                        break;
                    }
                }
            }
        }
    }
    cout << ans;
    return 0;
}
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: ACCEPTED
| input | 
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...  | 
| correct output | 
|---|
| 1584665 | 
| user output | 
|---|
| 1584665 | 
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: ACCEPTED
| input | 
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...  | 
| correct output | 
|---|
| 25325366 | 
| user output | 
|---|
| 25325366 | 
Test 15
Group: 4, 5, 6
Verdict: ACCEPTED
| input | 
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG...  | 
| correct output | 
|---|
| 22342463 | 
| user output | 
|---|
| 22342463 | 
Test 16
Group: 4, 5, 6
Verdict: ACCEPTED
| input | 
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...  | 
| correct output | 
|---|
| 25502500 | 
| user output | 
|---|
| 25502500 | 
Test 17
Group: 4, 5, 6
Verdict: ACCEPTED
| input | 
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...  | 
| correct output | 
|---|
| 25650 | 
| user output | 
|---|
| 25650 | 
Test 18
Group: 5, 6
Verdict: ACCEPTED
| input | 
|---|
| 200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...  | 
| correct output | 
|---|
| 403292767 | 
| user output | 
|---|
| 403292767 | 
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...  | 
| correct output | 
|---|
| 388111321 | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 5, 6
Verdict: ACCEPTED
| input | 
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...  | 
| correct output | 
|---|
| 404010000 | 
| user output | 
|---|
| 404010000 | 
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) | 
