# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464540 | 2021-08-13T11:30:15 Z | prvocislo | Difference (POI11_roz) | C++17 | 151 ms | 65540 KB |
#include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; int ans = 0; void solve(const vector<int>& v) // v je indexovane od 1 { int last_minus_one = -1; vector<int> pf(v.size(), 0), pf_min(v.size(), 0); // prefixove sucty, najmensi prefix doteraz for (int i = 1; i < v.size(); i++) { pf[i] = pf[i - 1] + v[i]; pf_min[i] = min(pf_min[i - 1], pf[i]); } for (int i = 1; i < v.size(); i++) { if (v[i] == -1) last_minus_one = i; if (last_minus_one != -1) ans = max(ans, pf[i] - pf_min[last_minus_one - 1]); } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; string s; cin >> s; vector<vector<vector<int> > > v(26, vector<vector<int> >(26, { 0 })); for (int i = 0; i < n; i++) { for (int j = 0; j < 26; j++) if (j != s[i] - 'a') { v[s[i] - 'a'][j].push_back(1); v[j][s[i] - 'a'].push_back(-1); } } for (int i = 0; i < 26; i++) for (int j = 0; j < 26; j++) if (j != i) solve(v[i][j]); cout << ans << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 304 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 972 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 3280 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 123 ms | 23332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 19 ms | 5480 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 144 ms | 65540 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 144 ms | 65540 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 140 ms | 65540 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 151 ms | 65540 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |