| Task: | Niitty |
| Sender: | viiviP |
| Submission time: | 2026-08-16 19:53:13 +0300 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 33 |
| subtask | 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 | subtask | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 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.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.07 s | 3, 4, 5, 6 | details |
| #11 | ACCEPTED | 0.06 s | 3, 4, 5, 6 | details |
| #12 | ACCEPTED | 0.07 s | 3, 4, 5, 6 | details |
| #13 | ACCEPTED | 0.04 s | 3, 4, 5, 6 | details |
| #14 | ACCEPTED | 0.53 s | 4, 5, 6 | details |
| #15 | ACCEPTED | 0.49 s | 4, 5, 6 | details |
| #16 | ACCEPTED | 0.50 s | 4, 5, 6 | details |
| #17 | ACCEPTED | 0.26 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 | 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 |
Code
#include <iostream>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<vector<vector<int>>> presum;
int mask = 0;
vector<int> vektoriSumma(vector<int> u, vector<int>j) {
vector<int>sum(26);
for (int i = 0; i<26;i++) {
sum[i] = u[i] + j[i];
}
return sum;
}
vector<int> vektoriErotus(vector<int>u, vector<int>j) {
vector<int>sum(26);
for (int i = 0; i<26;i++) {
sum[i] = u[i] - j[i];
}
return sum;
}
bool ok(vector<int>u) {
ll ans = 0;
for (int i = 0; i<26;i++) {
if (u[i] >0) ans |= 1<<i;
}
return ans==mask;
}
bool okAlue(int y1, int x1, int y2, int x2) {
vector<int>org = presum[y2][x2];
org = vektoriErotus(org, presum[y2][x1-1]);
org = vektoriErotus(org, presum[y1-1][x2]);
org = vektoriSumma(org, presum[y1-1][x1-1]);
return ok(org);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >>n;
vector<vector<int>>grid(n+1, vector<int> (n+1));
presum.resize(n+1, vector<vector<int>>(n+1, vector<int> (26)));
vector<vector<int>> v;
for (int i = 1; i<=n;i++) {
string s;
cin >>s;
for (int j = 1; j<=n;j++) {
int num = s[j-1]-'A';
//grid[i][j] = 1<<num;
grid[i][j] = num;
mask |= 1<<num;
}
}
for (int i = 1; i<=n;i++) {
vector<int> rivi(26);
for (int j = 1; j<=n;j++) {
//cout <<grid[i][j]<<" ";
rivi[grid[i][j]]++;
presum[i][j] = vektoriSumma(presum[i-1][j],rivi);
}
//cout <<"\n";
}
//cout <<mask<<"\n";
ll ans = 0;
for (int y1 = 1; y1<=n;y1++) {
for (int y2 = y1; y2<=n;y2++) {
int x1 = 1;
int x2 = 1;
while (x1<=n && x2<=n) {
if (okAlue(y1, x1, y2, x2)) {
ans += n-x2+1;
x1++;
} else {
x2++;
}
}
}
}
cout <<ans<<"\n";
}Test details
Test 1
Subtask: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
| correct output |
|---|
| 2035 |
| user output |
|---|
| 2035 |
Test 2
Subtask: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
| correct output |
|---|
| 9 |
| user output |
|---|
| 9 |
Test 3
Subtask: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
| correct output |
|---|
| 3025 |
| user output |
|---|
| 3025 |
Test 4
Subtask: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 12 |
Test 5
Subtask: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 X |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 6
Subtask: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
| correct output |
|---|
| 38724 |
| user output |
|---|
| 38724 |
Test 7
Subtask: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
| correct output |
|---|
| 8334 |
| user output |
|---|
| 8334 |
Test 8
Subtask: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
| correct output |
|---|
| 44100 |
| user output |
|---|
| 44100 |
Test 9
Subtask: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 10
Subtask: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
| correct output |
|---|
| 1584665 |
| user output |
|---|
| 1584665 |
Test 11
Subtask: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
| correct output |
|---|
| 1077746 |
| user output |
|---|
| 1077746 |
Test 12
Subtask: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
| correct output |
|---|
| 1625625 |
| user output |
|---|
| 1625625 |
Test 13
Subtask: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
| correct output |
|---|
| 1680 |
| user output |
|---|
| 1680 |
Test 14
Subtask: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
| correct output |
|---|
| 25325366 |
| user output |
|---|
| 25325366 |
Test 15
Subtask: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
| correct output |
|---|
| 22342463 |
| user output |
|---|
| 22342463 |
Test 16
Subtask: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
| correct output |
|---|
| 25502500 |
| user output |
|---|
| 25502500 |
Test 17
Subtask: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
| correct output |
|---|
| 25650 |
| user output |
|---|
| 25650 |
Test 18
Subtask: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
| correct output |
|---|
| 403292767 |
| user output |
|---|
| (empty) |
Test 19
Subtask: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
| correct output |
|---|
| 388111321 |
| user output |
|---|
| (empty) |
Test 20
Subtask: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
| correct output |
|---|
| 404010000 |
| user output |
|---|
| (empty) |
Test 21
Subtask: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
| correct output |
|---|
| 14159445 |
| user output |
|---|
| (empty) |
Test 22
Subtask: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW... |
| correct output |
|---|
| 15683003812 |
| user output |
|---|
| (empty) |
Test 23
Subtask: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE... |
| correct output |
|---|
| 15575906951 |
| user output |
|---|
| (empty) |
Test 24
Subtask: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
| correct output |
|---|
| 15687562500 |
| user output |
|---|
| (empty) |
Test 25
Subtask: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW... |
| correct output |
|---|
| 3058970930 |
| user output |
|---|
| (empty) |
